Hamilton cycles in 5-connected line graphs - Mathematics > CombinatoricsReportar como inadecuado




Hamilton cycles in 5-connected line graphs - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: A conjecture of Carsten Thomassen states that every 4-connected line graph ishamiltonian. It is known that the conjecture is true for 7-connected linegraphs. We improve this by showing that any 5-connected line graph of minimumdegree at least 6 is hamiltonian. The result extends to claw-free graphs and toHamilton-connectedness.



Autor: Tomáš Kaiser, Petr Vrána

Fuente: https://arxiv.org/







Documentos relacionados