A twelve vertex theorem for 3-connected claw-free graphs (Q292255)
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: A twelve vertex theorem for 3-connected claw-free graphs |
scientific article; zbMATH DE number 6592579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A twelve vertex theorem for 3-connected claw-free graphs |
scientific article; zbMATH DE number 6592579 |
Statements
A twelve vertex theorem for 3-connected claw-free graphs (English)
0 references
13 June 2016
0 references
cyclability
0 references
claw-free graphs
0 references
Eulerian subgraphs
0 references
line graphs
0 references
0 references
0.9198749
0 references
0.8902811
0 references
0.8901502
0 references
0.8838732
0 references
0.8812546
0 references
0.8802375
0 references
0 references
