On 3-connected graphs with contractible edge covers of size \(k\)

DOI10.1016/0012-365X(92)90597-9zbMath0789.05054MaRDI QIDQ1197021

Xingxing Yu, R. L. Hemminger

Publication date: 16 January 1993

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

zbMATH Keywords

3-connectivitycontractible edge

Mathematics Subject Classification ID

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

Related Items (4)

Minimal locally cyclic triangulations of the projective plane ⋮ The 3‐connected graphs with a maximum matching containing precisely one contractible edge ⋮ Non-contractible edges in a 3-connected graph ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractible edges in 3-connected graphs
• Planarity and duality of finite and infinite graphs
• Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets

This page was built for publication: On 3-connected graphs with contractible edge covers of size \(k\)