Characterization of minimally \((2,l)\)-connected graphs (Q1944218): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:00, 1 February 2024
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
