Characterization of minimally \((2,l)\)-connected graphs (Q1944218)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterization of minimally \((2,l)\)-connected graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterization of minimally \((2,l)\)-connected graphs |
scientific article |
Statements
Characterization of minimally \((2,l)\)-connected graphs (English)
0 references
4 April 2013
0 references
combinatorial problems
0 references
connectivity
0 references
minimally \(k\)-connected graphs
0 references
\(l\)-connectivity
0 references
\((k,l)\)-connected graphs
0 references
minimally \((2,l)\)-connected graphs
0 references
