Eulerian subgraphs containing given vertices and hamiltonian line graphs

DOI10.1016/S0012-365X(97)81820-1zbMath0892.05026MaRDI QIDQ1377854

Hong-Jian Lai

Publication date: 26 January 1998

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

zbMATH Keywords

line graphhamiltonianeulerian graphdominating eulerian subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

A note on minimum degree conditions for supereulerian graphs ⋮ Parameterized edge Hamiltonicity ⋮ Fan-type conditions for spanning Eulerian subgraphs ⋮ On traceable line graphs ⋮ Lai's conditions for spanning and dominating closed trails ⋮ Hamiltonicity in 3-connected claw-free graphs ⋮ Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

Cites Work

• Unnamed Item
• On dominating and spanning circuits in graphs
• On circuits and pancyclic line graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• Collapsible graphs and matchings
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Eulerian subgraphs containing given vertices and hamiltonian line graphs