Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph

DOI10.7151/DMGT.2209MaRDI QIDQ2227113zbMATH OpenOpenAlexWikidataFDO

Authors Jichang Wu, Yaping Mao, Qin Ma, Hajo Broersma

Publication date 10 February 2021

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2209

zbMATH Keywords

4-connected graphatomfragmentremovable edge

Mathematics Subject Classification ID

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

Recommendations

• Removable edges in a cycle of a 4-connected graph
• The number of removable edges in a 4-connected graph
• Removable edges in longest cycles of 4-connected graphs
• scientific article; zbMATH DE number 1500199
• Removable edges in cycles of a k-connected graph

Cites work

• A classification of 4-connected graphs
• Graph theory
• scientific article; zbMATH DE number 1500199 (Why is no real title available?)
• On the number of 4-contractible edges in 4-connected graphs
• Removable edges and chords of longest cycles in 3-connected graphs
• Removable edges in 3-connected graphs
• Removable edges in a cycle of a 4-connected graph
• The number of removable edges in a 4-connected graph

Cited in

(6)

• Removable edges in a cycle of a 4-connected graph
• Removable edges in the longest cycles of a 4-connected graph
• Removable edges in a spanning tree of a 4-connected graph
• scientific article; zbMATH DE number 1500199 (Why is no real title available?)
• Removable edges in cycles of a k-connected graph
• Removable edges in longest cycles of 4-connected graphs

This page was built for publication: Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph

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