Supereulerian graphs, independent sets, and degree-sum conditions

DOI10.1016/S0012-365X(97)00028-9zbMath0890.05048MaRDI QIDQ1377709

Zhi-Hong Chen

Publication date: 29 June 1998

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

zbMATH Keywords

independence numbercollapsiblesupereulerianreduced graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Spanning trails with variations of Chvátal-Erdős conditions ⋮ Fan-type conditions for spanning Eulerian subgraphs ⋮ Lai's conditions for spanning and dominating closed trails ⋮ The Chvátal-Erdős condition for group connectivity in graphs ⋮ The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractions of graphs with no spanning Eulerian subgraphs
• Spanning Eulerian subgraphs and matchings
• Existence of spanning and dominating trails and circuits
• On circuits and pancyclic line graphs
• Contractions and hamiltonian line graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• On Spanning and Dominating Circuits in Graphs
• A degree condition for spanning eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Supereulerian graphs, independent sets, and degree-sum conditions