Decomposition of a graph into paths: structural and algorithmic aspects
Electroencephalographic fingerprints of statistical model selection by the brain
Weingarten surfaces in R^3 and complete hypersurfaces with negative Ricci curvatur...
| Full text | |
| Author(s): |
Botler, Fabio
;
Jimenez, Andrea
;
Sambinelli, Maycon
;
Wakabayashi, Yoshiko
;
Ferreira, CE
;
Lee, O
;
Miyazawa, FK
Total Authors: 7
|
| Document type: | Journal article |
| Source: | PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM; v. 195, p. 9-pg., 2021-01-01. |
| Abstract | |
The 2-Decomposition Conjecture, equivalent to the 3-Decomposition Conjecture stated in 2011 by Hoffmann-Ostenhof, claims that every connected graph G with vertices of degree 2 and 3, and satisfying that G - E(C) is disconnected for every cycle C, admits a decomposition into a spanning tree and a matching. In this work we show that the 2-Decomposition Conjecture holds for graphs whose vertices of degree 3 induce a collection of cacti in which each vertex belongs to a cycle. (C) 2021 The Authors. Published by Elsevier B.V. (AU) | |
| FAPESP's process: | 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points |
| Grantee: | Flávio Keidi Miyazawa |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 19/13364-7 - Extremal and structural problems in graph theory |
| Grantee: | Cristina Gomes Fernandes |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 17/23623-4 - Partition problems in graphs and digraphs |
| Grantee: | Maycon Sambinelli |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |