Even Subdivision-Factors of Cubic Graphs

arXiv1211.1714MaRDI QIDQ6236993FDOQ6236993

Authors: Arthur Hoffmann-Ostenhof 

Publication date: 7 November 2012

Abstract: We call a set $mathcalS$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $mathcalS$. We show that any set of 2-connected graphs which is an even subdivison-factor of every 3-connected cubic graph, satisfies certain properties. As a consequence, we disprove a conjecture which was stated in an attempt to solve the circuit double cover conjecture.

This page was built for publication: Even Subdivision-Factors of Cubic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236993)