Intersection of longest cycle and largest bond in 3-connected graphs

DOI10.1007/978-3-031-83864-4_4MaRDI QIDQ7236422zbMATH OpenFDO

Authors Emily Ren

Publication date 29 April 2026

Full work available at URL https://doi.org/10.1007/978-3-031-83864-4_4

zbMATH Keywords

3-connected graphbondco-spectrumcycle

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A theorem on tait colorings with an application to the generalized Petersen graphs
• An Upper Bound on the Number of Edges of a 2-Connected Graph
• Bonds intersecting cycles in a graph
• Bonds Intersecting Long Paths in \(k\) -Connected Graphs
• scientific article; zbMATH DE number 5073484 (Why is no real title available?)
• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• Large \(W_k\)- or \(K_{3,t}\)-minors in 3-connected graphs

This page was built for publication: Intersection of longest cycle and largest bond in 3-connected graphs

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