On the existence of \((k,l)\)-critical graphs

DOI10.1016/S0012-365X(97)00100-3zbMath0891.05048OpenAlexW2166681563MaRDI QIDQ1377731

Tibor Jordán

Publication date: 8 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00100-3

zbMATH Keywords

connectivitycritical graphfragment

Mathematics Subject Classification ID

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

Related Items (3)

The symmetric (2k, k)-graphs ⋮ The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) ⋮ High connectivity keeping sets in graphs and digraphs

Cites Work

• Unnamed Item
• On locally \(k\)-critically \(n\)-connected graphs
• On k-critical, n-connected graphs
• On the optimal vertex-connectivity augmentation
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Fragments in kcritical n‐connected graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: On the existence of \((k,l)\)-critical graphs