Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected (Q1003612)
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: Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected |
scientific article; zbMATH DE number 5523109
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected |
scientific article; zbMATH DE number 5523109 |
Statements
Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected (English)
0 references
4 March 2009
0 references
minimum restricted edge cut
0 references
minimally restricted \(k\)-edge connected
0 references
0 references
