Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets

DOI10.1002/jgt.3190140603zbMath0745.05042OpenAlexW2090062879MaRDI QIDQ3970896

Akira Saito

Publication date: 25 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140603

zbMATH Keywords

3-connected graphcovering of contractible edges

Mathematics Subject Classification ID

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

Related Items (5)

On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ On 3-connected graphs with contractible edge covers of size \(k\) ⋮ Unnamed Item ⋮ Contractible non-edges in \(3\)-connected graphs ⋮ Contractible subgraphs in 3-connected graphs

Cites Work

• On obstructions to small face covers in planar graphs
• Unnamed Item

This page was built for publication: Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets