Collapsible graphs and Hamilton cycles of line graphs

DOI10.1016/J.DAM.2015.05.030zbMATH Open1319.05111OpenAlexW2201047783MaRDI QIDQ494432FDOQ494432

Authors: Xiangwen Li, Yan Xiong 

Publication date: 1 September 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.030

Recommendations

• Collapsible graphs and reductions of line graphs
• Collapsible graphs and Hamiltonicity of line graphs
• Collapsible graphs and matchings
• Properties of Catlin's reduced graphs and supereulerian graphs
• Collapsible graphs and Hamiltonian connectedness of line graphs

zbMATH Keywords

line graphcollapsible graphHamilton cycleEulerian graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• A reduction method to find spanning Eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• On hamiltonian line graphs
• Collapsible graphs and Hamiltonian connectedness of line graphs
• Reflections on graph theory
• Super-Eulerian graphs of minimum degree at least \(4\).
• Title not available (Why is that?)
• Spanning trails
• Hamiltonian line graphs
• Collapsible graphs and matchings
• A note on collapsible graphs and super-Eulerian graphs
• Contractions of graphs with no spanning Eulerian subgraphs
• Spanning Eulerian subgraphs and matchings
• Collapsible graphs and Hamiltonicity of line graphs

Cited In (5)

• Collapsible graphs and matchings
• Collapsible graphs and reductions of line graphs
• Collapsible graphs and Hamiltonicity of line graphs
• Title not available (Why is that?)
• Fan-type conditions for collapsible graphs

This page was built for publication: Collapsible graphs and Hamilton cycles of line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494432)