Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three

DOI10.1002/jgt.3190170212zbMath0782.05064OpenAlexW1988512979MaRDI QIDQ4693361

Xingxing Yu, R. L. Hemminger

Publication date: 17 August 1993

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

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

zbMATH Keywords

characterizationedge cover3-connected graphscontractible edges

Mathematics Subject Classification ID

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

Related Items (3)

Non-separating cycles and discrete Jordan curves ⋮ Unnamed Item ⋮ Contractible non-edges in \(3\)-connected graphs

This page was built for publication: Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three