Removable edges of cycles in 5-connected graphs

DOI10.1007/S12190-008-0079-7zbMath1148.05043OpenAlexW2068169258MaRDI QIDQ949343

Haiyan Kang, Jichang Wu, Guo Jun Li

Publication date: 21 October 2008

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-008-0079-7

zbMATH Keywords

5-connected graphremovable edgeedge-vertex-cut fragmentedge-vertex-cut atom

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of removable edges in 3-connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• The number of removable edges in a 4-connected graph
• Removable edges in a cycle of a 4-connected graph
• Removable edges in a 5-connected graph and a construction method of 5-connected graphs
• Removable edges in 3-connected graphs
• Uncontractable 4-connected graphs

This page was built for publication: Removable edges of cycles in 5-connected graphs