Traceability of line graphs

DOI10.1016/j.disc.2008.10.012zbMath1218.05085OpenAlexW2023992355MaRDI QIDQ1043544

Minmin Zong, Limning Xiong

Publication date: 9 December 2009

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

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

zbMATH Keywords

line graphdominating trailspanning traildegree sum of adjacent verticesHamiltonian cycle(path)

Mathematics Subject Classification ID

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

Related Items (6)

Degree sums of adjacent vertices for traceability of claw-free graphs ⋮ Traceability on 2-connected line graphs ⋮ Spanning paths in graphs ⋮ On traceable line graphs ⋮ The Chvátal-Erdős condition for a graph to have a spanning trail ⋮ Spanning trails in a 2-connected graph

Cites Work

• Unnamed Item
• Contractions of graphs with no spanning Eulerian subgraphs
• On dominating and spanning circuits in graphs
• On hamiltonian line graphs
• Existence of spanning and dominating trails and circuits
• On circuits and pancyclic line graphs
• A reduction method to find spanning Eulerian subgraphs
• Hamiltonian line graphs
• Collapsible graphs and matchings
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Traceability of line graphs