Group connectivity in line graphs (Q641209)
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: Group connectivity in line graphs |
scientific article; zbMATH DE number 5961742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Group connectivity in line graphs |
scientific article; zbMATH DE number 5961742 |
Statements
Group connectivity in line graphs (English)
0 references
21 October 2011
0 references
The authors study the Tutte-Jaeger conjecture and they prove the following theorem: (1) Every 5-edge-connected graph is \({\mathbb{Z}}_3\)-connected if and only if every 5-edge-connected line graph is \({\mathbb{Z}}_3\)-connected; (2) The following graphs are \({\mathbb{Z}}_3\)-connected and hence each has a nowhere zero 3-flow: 6-edge-connected triangular line graphs and 7-edge-connected triangular claw-free graphs.
0 references
nowhere zero flows
0 references
group connectivity
0 references
line graphs
0 references
claw-free graphs
0 references
triangular graphs
0 references
0 references
0.9106073975563048
0 references
0.893374502658844
0 references
0.866523027420044
0 references
0.8590162992477417
0 references
0.8569477796554565
0 references
