Graphs without short odd cycles are nearly bipartite (Q1356557)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs without short odd cycles are nearly bipartite |
scientific article |
Statements
Graphs without short odd cycles are nearly bipartite (English)
0 references
24 September 1997
0 references
odd cycles
0 references
