On extremal \(k\)-outconnected graphs

DOI10.1016/j.disc.2007.06.011zbMath1151.05032OpenAlexW2008391666MaRDI QIDQ2427512

Zeev Nutov

Publication date: 13 May 2008

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

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

zbMATH Keywords

extremal graphsminimally \(k\)-outconnected graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Minimally k-connected graphs of low order and maximal size
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
• On rooted node-connectivity problems

This page was built for publication: On extremal \(k\)-outconnected graphs