The number of removable edges in a 4-connected graph

DOI10.1016/j.jctb.2004.02.003zbMath1052.05040OpenAlexW2051302442MaRDI QIDQ1880787

Jichang Wu, Jianji Su, Xue Liang Li

Publication date: 1 October 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.02.003

zbMATH Keywords

4-connected graphsRemovable edge

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (5)

Removable edges in a spanning tree of a \(k\)-connected graph ⋮ Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph ⋮ Removable edges of cycles in 5-connected graphs ⋮ Removable edges in cycles of a \(k\)-connected graph ⋮ Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs

Cites Work

• Uncontractable 4-connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of removable edges in a 4-connected graph