Spanning closed trails in graphs

DOI10.1016/0012-365X(93)90324-MzbMATH Open0782.05052MaRDI QIDQ686147FDOQ686147

Zhi-Hong Chen

Publication date: 1 November 1993

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

zbMATH Keywords

matchingclosed trailcoveringEulerian graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Factorization of Linear Graphs
• On dominating and spanning circuits in graphs
• Title not available (Why is that?)
• A reduction method to find spanning Eulerian subgraphs
• Collapsible graphs and matchings
• On circuits and pancyclic line graphs
• Spanning Eulerian subgraphs and matchings

Cited In (9)

• Title not available (Why is that?)
• Graphs without spanning closed trails
• Sparse graphs which decompose into closed trails of arbitrary lengths
• Title not available (Why is that?)
• Spanning closed trail and hamiltonian cycle in grid graphs
• Spanning trails in a 2-connected graph
• Spanning 2‐trails from degree sum conditions
• An \(s\)-Hamiltonian line graph problem
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs

   Recommendations

• Spanning trails in a 2-connected graph 👍 👎
• Spanning 2‐trails from degree sum conditions 👍 👎
• Spanning trails with variations of Chvátal-Erdős conditions 👍 👎
• Title not available (Why is that?) 👍 👎
• Spanning trails connecting given edges 👍 👎

This page was built for publication: Spanning closed trails in graphs

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