Removable edges in a cycle of a 4-connected graph

DOI10.1016/j.disc.2004.05.015zbMath1161.05329OpenAlexW2095779540MaRDI QIDQ1886346

Lusheng Wang, Jichang Wu, Xue Liang Li

Publication date: 18 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.05.015

zbMATH Keywords

atom4-connected graphremovable edgeedge-vertex-cut fragmentedge-vertex-cut

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 ⋮ A Hilbert integral-type inequality with parameters ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Removable edges in a cycle of a 4-connected graph