Characterization of minimally \((2,l)\)-connected graphs (Q1944218): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.09.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078756938 / rank | |||
Normal rank | |||
Revision as of 21:34, 19 March 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
