The Hamiltonicity of essentially 9‐connected line graphs

DOI10.1002/jgt.22653zbMath1521.05093arXiv2001.00042OpenAlexW3111947860MaRDI QIDQ6055939

Tomáš Kaiser, Petr Vrána

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.00042

zbMATH Keywords

line graphHamilton cycleHamilton-connectivityessential edge-connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Quasigraphs and skeletal partitions, Spanning tree packing and 2-essential edge-connectivity

Cites Work

• Unnamed Item
• Hamilton cycles in 5-connected line graphs
• Collapsible graphs and Hamiltonian connectedness of line graphs
• Hamiltonicity of 3-connected line graphs
• On \(s\)-Hamiltonian-connected line graphs
• Every 3-connected essentially 10-connected line graph is Hamilton-connected
• Eulerian subgraphs and Hamilton-connected line graphs
• Quasigraphs and skeletal partitions
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Reflections on graph theory