On minimally \((n,\lambda)\)-connected graphs

DOI10.1006/jctb.2000.1979zbMath1027.05053OpenAlexW2093066148MaRDI QIDQ1850492

Katsuhiro Ota, Atsushi Kaneko

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1979

zbMATH Keywords

edge-connectivityvertex-connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

Sparse connectivity certificates via MA orderings in graphs, Uniformly 3‐connected graphs, Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs, On Frank's conjecture on \(k\)-connected orientations, The \((2, k)\)-connectivity augmentation problem: algorithmic aspects, Mixed connectivity properties of random graphs and some special graphs, A sufficient connectivity condition for generic rigidity in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimally k-connected graphs of low order and maximal size
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• A mixed version of Menger's theorem
• The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• The connectivity function of a graph