Extremal 3-connected graphs

DOI10.1016/0012-365X(88)90117-3zbMath0652.05028OpenAlexW2019516099MaRDI QIDQ1106857

Stephen C. Locke

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90117-3

zbMATH Keywords

independent set3-connected graphlongest path2-connected graphs

Mathematics Subject Classification ID

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

Cites Work

• A generalization of Dirac's theorem
• Relative lengths of paths and cycles in k-connected graphs
• Long paths and large cycles in finite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal 3-connected graphs