Spanning closed trails in graphs

DOI10.1016/0012-365X(93)90324-MzbMath0782.05052MaRDI QIDQ686147

Zhi-Hong Chen

Publication date: 1 November 1993

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

zbMATH Keywords

coveringmatchingEulerian graphclosed trail

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items

Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs, An \(s\)-Hamiltonian line graph problem

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning Eulerian subgraphs and matchings
• On dominating and spanning circuits in graphs
• On circuits and pancyclic line graphs
• A reduction method to find spanning Eulerian subgraphs
• Collapsible graphs and matchings
• The Factorization of Linear Graphs