Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Alexandr V. Kostochka / rank | |||
Property / author | |||
Property / author: Alexandr V. Kostochka / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57601430 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2108787881 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0904.2282 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extending precolorings to circular colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Theory and Probability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: High-girth graphs avoiding a minor are nearly bipartite / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4946546 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4894618 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The circular chromatic number of series-parallel graphs of large odd girth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3808121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4865530 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circular chromatic number: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3424895 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
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