The 2-Decomposition Conjecture for a new class of graphs

Vista sencilla de ítem
dc.contributor.authorBotler, Fabio
dc.contributor.authorJimenez, Andrea
dc.contributor.authorSambinelli, Maycon
dc.contributor.authorWakabayashi, Yoshiko
dc.date.accessioned2022-11-30T02:46:12Z
dc.date.available2022-11-30T02:46:12Z
dc.date.issued2021
dc.description.abstractThe 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.en_ES
dc.facultadFacultad de Ingenieríaen_ES
dc.file.nameBotler_2-D2021.pdf
dc.identifier.doihttps://doi.org/10.1016/j.procs.2021.11.044
dc.identifier.urihttp://repositoriobibliotecas.uv.cl/handle/uvscl/7248
dc.languageen
dc.publisherElsevier
dc.rightsUnder a Creative Commons license
dc.sourceProcedia Computer Science
dc.subjectGRAPH DECOMPOSITIONen_ES
dc.subjectCUBIC GRAPHSen_ES
dc.subject3-DECOMPOSITION CONJECTUREen_ES
dc.subjectHISTen_ES
dc.subjectSPANNING TREESen_ES
dc.titleThe 2-Decomposition Conjecture for a new class of graphs
dc.typeArticulo
uv.departamentoCIMFAV
uv.notageneralNo disponible para descarga

Archivos

Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
Botler_2-D2021_noaccesible_.pdf
Tamaño:
381.73 KB
Formato:
Adobe Portable Document Format
Descripción:
Descargar

Colecciones

Artículos investigadores UV