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

From MaRDI portal
Revision as of 02:11, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q214987)
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
    5 November 2010
    0 references
    0 references
    circular coloring
    0 references
    odd-girth
    0 references
    tree-width
    0 references
    0 references