Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5810778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with bounded tree-width and large odd-girth are almost bipartite |
scientific article; zbMATH DE number 5810778 |
Statements
Graphs with bounded tree-width and large odd-girth are almost bipartite (English)
0 references
5 November 2010
0 references
circular coloring
0 references
odd-girth
0 references
tree-width
0 references
0.7975027561187744
0 references
0.7963628768920898
0 references
0.7897089123725891
0 references
0.77707839012146
0 references
0.7695326805114746
0 references
