Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 0904.2282 / rank | |||
Normal rank | |||
Revision as of 16:19, 18 April 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
