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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108787881 / rank
 
Normal rank

Revision as of 03:11, 20 March 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
    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
    0 references