The contractible edges of a spanning tree and a perfect matching in k-connected graphs

DOI10.6040/J.ISSN.1671-9352.0.2016.148MaRDI QIDQ2984686zbMATH OpenFDO

Authors Qian Wang

Publication date 17 May 2017

zbMATH Keywords

perfect matchingspanning treecontractible edge\(k\)-connect graph

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Contractible edges in subgraphs of \(2\)-connected graphs
• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees
• Connectivity of the graph induced by contractible edges of a \(k\)-tree
• Contractible edges and removable edges in 3-connected graphs
• Contractible Edges in a k-Connected Graph

Cited in

(2)

• Contractible edges in subgraphs of \(2\)-connected graphs
• Graphs where each spanning tree has a perfect matching

This page was built for publication: The contractible edges of a spanning tree and a perfect matching in \(k\)-connected graphs

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