Removable edges in longest cycles of 4-connected graphs

DOI10.1007/S00373-004-0566-ZzbMATH Open1054.05061OpenAlexW2019715103MaRDI QIDQ704835

Jichang Wu, Xueliang Li

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0566-z

zbMATH Keywords

4-connected graphcontractible edgeremovable edgeedge-vertex-cut fragment

Mathematics Subject Classification ID

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

Related Items (2)

The number of removable edges in a 4-connected graph ⋮ Removable edges of cycles in 5-connected graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704835)