Removable edges in longest cycles of 4-connected graphs

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

Authors: 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

Recommendations

• Removable edges in a cycle of a 4-connected graph
• Removable edges in the longest cycles of a 4-connected graph
• The number of removable edges in a 4-connected graph
• Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
• scientific article; zbMATH DE number 1500199

zbMATH Keywords

4-connected graphcontractible edgeremovable edgeedge-vertex-cut fragment

Mathematics Subject Classification ID

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

Cited In (6)

• Removable edges in the longest cycles of a 4-connected graph
• Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
• The number of removable edges in a 4-connected graph
• Removable edges in a cycle of a 4-connected graph
• On removable cycles through every edge
• 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)