Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711): Difference between revisions
From MaRDI portal
Latest revision as of 10:55, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graphs with bounded tree-width and large odd-girth are almost bipartite |
scientific article |
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