Super-Eulerian graphs, collapsible graphs and matchings

MaRDI QIDQ5276339zbMATH OpenFDO

Authors Mingqiang An, Liming Xiong

Publication date 14 July 2017

zbMATH Keywords

collapsible graphcontractionindependent edgessupereulerian graph

Mathematics Subject Classification ID

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

Recommendations

• Supereulerian graphs and matchings
• scientific article; zbMATH DE number 19176
• scientific article; zbMATH DE number 1854059
• Supereulerian graphs and small matching number
• Spanning Eulerian subgraphs and matchings

Cited in

(19)

• Contractions of graphs with no spanning Eulerian subgraphs
• Spanning Eulerian subgraphs and matchings
• Supereulerian graphs, independent sets, and degree-sum conditions
• Collapsible subgraphs of a 4-edge-connected graph
• Forbidden subgraphs for collapsible graphs and supereulerian graphs
• Eulerian subgraphs and \(S\)-connectivity of graphs
• Chvátal-Erdős conditions and almost spanning trails
• Supereulerian graphs with constraints on the matching number and minimum degree
• Super-Eulerian graphs and the Petersen graph. II
• Collapsible super-biclaw-free graphs
• scientific article; zbMATH DE number 4055653 (Why is no real title available?)
• scientific article; zbMATH DE number 19176 (Why is no real title available?)
• Collapsible graphs and matchings
• A note on collapsible graphs and super-Eulerian graphs
• Supereulerian graphs with few independent edges.
• scientific article; zbMATH DE number 908784 (Why is no real title available?)
• Constructing featured supereulerian graph
• Supereulerian graphs and small matching number
• Supereulerian graphs and matchings

This page was built for publication: Super-Eulerian graphs, collapsible graphs and matchings

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