Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711)

From MaRDI portal
Revision as of 21:52, 5 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57601430, #quickstatements; #temporary_batch_1707161894653)
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
    0 references
    0 references
    0 references
    0 references
    5 November 2010
    0 references
    0 references
    circular coloring
    0 references
    odd-girth
    0 references
    tree-width
    0 references
    0 references