Intersections of largest bonds in \(k\)-connected graphs

DOI10.1016/J.DISC.2008.12.015zbMath1202.05081OpenAlexW2115320807MaRDI QIDQ1043581

Laura Sheppardson

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.015

zbMATH Keywords

bondcocircuitcycle intersectionminimal edge cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Unnamed Item
• Intersections of longest cycles in \(k\)-connected graphs
• Largest circuits in matroids
• On deletions of largest bonds in graphs
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles

This page was built for publication: Intersections of largest bonds in \(k\)-connected graphs