The 2-Decomposition Conjecture for a new class of graphs
Fecha
2021
Profesor Guía
Formato del documento
Articulo
ORCID Autor
Título de la revista
ISSN de la revista
Título del volumen
Editor
Elsevier
Ubicación
ISBN
ISSN
item.page.issne
item.page.doiurl
Facultad
Facultad de Ingeniería
Departamento o Escuela
CIMFAV
Determinador
Recolector
Especie
Nota general
No disponible para descarga
Resumen
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.
Descripción
Lugar de Publicación
Auspiciador
Palabras clave
GRAPH DECOMPOSITION, CUBIC GRAPHS, 3-DECOMPOSITION CONJECTURE, HIST, SPANNING TREES
Licencia
Under a Creative Commons license