2 papers
math.CO2010
Hamilton cycles in 5-connected line graphs
Tomáš Kaiser, Petr Vrána
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by s…
math.CO2010
Covering a graph by forests and a matching
Tomas Kaiser, Mickael Montassier, Andre Raspaud
We prove that for any positive integer , the edges of any graph whose fractional arboricity is at most can be decomposed into forests and a matching.