Contractions of graphs with no spanning Eulerian subgraphs

DOI10.1007/BF02189088zbMath0659.05064OpenAlexW1997421716MaRDI QIDQ1112064

Paul A. Catlin

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02189088

zbMATH Keywords

collapsible graphsspanning Eulerian subgraphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Supereulerian graphs, independent sets, and degree-sum conditions ⋮ Spanning Eulerian subgraphs and matchings ⋮ Ramsey numbers for matchings ⋮ Fan-type conditions for spanning Eulerian subgraphs ⋮ A reduction method to find spanning Eulerian subgraphs ⋮ Collapsible graphs and Hamilton cycles of line graphs ⋮ Sufficient Ore type condition for a digraph to be supereulerian ⋮ Duality in graph families ⋮ Lai's conditions for spanning and dominating closed trails ⋮ Subgraphs with triangular components ⋮ Traceability of line graphs ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ On dominating and spanning circuits in graphs

Cites Work

• Spanning Eulerian subgraphs and matchings
• On circuits and pancyclic line graphs
• On Spanning and Dominating Circuits in Graphs
• A Note on Sub-Eulerian Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Contractions of graphs with no spanning Eulerian subgraphs