Degree sum and Hamiltonian-connected line graphs

DOI10.1016/J.DISC.2018.02.008zbMath1383.05274OpenAlexW2790556826MaRDI QIDQ1709539

Hong-Jian Lai, Ai-Mei Yu, Jian Ping Liu, Ke-ke Wang

Publication date: 5 April 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.02.008

zbMATH Keywords

reductionHamiltonian-connected graphline graphscollapsible graphsspanning trailable graphs

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Hamilton-connectivity of line graphs with application to their detour index ⋮ Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ On the extended Clark-Wormold Hamiltonian-like index problem ⋮ Catlin’s reduced graphs with small orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trails containing given edges
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• Eulerian subgraphs and Hamilton-connected line graphs
• Contractions and hamiltonian line graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Degree sum and Hamiltonian-connected line graphs