Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
From MaRDI portal
Publication:2227113
DOI10.7151/dmgt.2209zbMath1458.05129OpenAlexW2918908769WikidataQ128281223 ScholiaQ128281223MaRDI QIDQ2227113
Jichang Wu, Yaping Mao, Qin Ma, Hajo J. Broersma
Publication date: 10 February 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2209
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- A classification of 4-connected graphs
- The number of removable edges in a 4-connected graph
- Removable edges in a cycle of a 4-connected graph
- Removable edges and chords of longest cycles in 3-connected graphs
- On the number of 4-contractible edges in 4-connected graphs
- Removable edges in 3-connected graphs
This page was built for publication: Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph