Graphs without short odd cycles are nearly bipartite (Q1356557)
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: Graphs without short odd cycles are nearly bipartite |
scientific article; zbMATH DE number 1018641
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs without short odd cycles are nearly bipartite |
scientific article; zbMATH DE number 1018641 |
Statements
Graphs without short odd cycles are nearly bipartite (English)
0 references
24 September 1997
0 references
odd cycles
0 references
0.9242283
0 references
0.9209467
0 references
0.9056037
0 references
0 references
0.88922346
0 references
0.88605595
0 references
0 references
0.88028604
0 references
