Cycles in line graphs and the preimage graphs
Kiyoshi Yoshimoto
28 March 2014, 14h30 - 28 March 2014, 15h30 Salle/Bat : 465/PCRI-N
Contact :
Activités de recherche : Théorie des graphes
Résumé :
Thomassen conjectured that a 4-connected line graph is hamiltonian. In this talk, we consider cycle problems on line graphs or claw-free graphs and show several results of 2-factors in claw-free graphs and of even subgraphs in the preimage graphs of line graphs. Also we consider cycle problems of cubic graphs which relate to Thomassen’s conjecture.
