Spanning Eulerian subgraphs and matchings

DOI10.1016/0012-365X(89)90303-8zbMath0679.05051MaRDI QIDQ1124608

Paul A. Catlin

Publication date: 1989

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

zbMATH Keywords

graphcontractionmatchingspanning Eulerian subgraph

Mathematics Subject Classification ID

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

Related Items

A note on minimum degree conditions for supereulerian graphs, Contractions of graphs with no spanning Eulerian subgraphs, Supereulerian graphs, independent sets, and degree-sum conditions, Graphs without spanning closed trails, Collapsible graphs and Hamilton cycles of line graphs, Spanning closed trails in graphs, Duality in graph families, On dominating and spanning circuits in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Contractions of graphs with no spanning Eulerian subgraphs
• Existence of dominating cycles and paths
• 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
• Spanning trails
• Hamiltonian line graphs
• On Spanning and Dominating Circuits in Graphs
• The Factorization of Linear Graphs