On minimally \((n,\lambda)\)-connected graphs
type: Item
instance of: scholarly article
title: On minimally \((n,\lambda)\)-connected graphs
zbMATH Open document ID: 1027.05053
author: Atsushi Kaneko
author: Katsuhiro Ota
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1843723
zbMATH Keywords: vertex-connectivity
zbMATH Keywords: edge-connectivity
MaRDI profile type: Publication
full work available at URL: jctb.2000.1979
OpenAlex ID: W2093066148
cites work: The connectivity function of a graph
cites work: Q3818315
cites work: Q4143334
cites work: A mixed version of Menger's theorem
cites work: The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint
cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen
cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
cites work: Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
cites work: Q4189309
cites work: Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
cites work: Q4878669
cites work: Minimally k-connected graphs of low order and maximal size
cites work: Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
DOI: 10.1006/JCTB.2000.1979
description: scientific article; zbMATH DE number 1843723