article · 2014
Avoiding 7-Circuits in 2-Factors of Cubic Graphs
Let $G$ be a cyclically $4$-edge-connected cubic graph with girth at least $7$ on $n$ vertices. We show that $G$ has a $2$-factor $F$ such that at least a li...
1 citationsDOI: https://doi.org/10.37236/4379Open accessPDF reported by metadataFull text reported by metadata