Sparse Graphs Are Near-Bipartite (Q5130577)

From MaRDI portal
Revision as of 02:40, 13 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article; zbMATH DE number 7267906
Language Label Description Also known as
English
Sparse Graphs Are Near-Bipartite
scientific article; zbMATH DE number 7267906

    Statements

    title
    Sparse Graphs Are Near-Bipartite (English)
    0 references
    DOI
    10.1137/19M1299712
    0 references
    author
    Daniel W. Cranston
    0 references
    Matthew P. Yancey
    0 references
    publication date
    28 October 2020
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C42
    0 references
    05C70
    0 references
    05C75
    0 references
    zbMATH DE Number
    7267906
    0 references
    zbMATH Keywords
    near-bipartite graph
    0 references
    potential method
    0 references
    4-critical graph
    0 references
    coloring
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5130577&oldid=20922963"
    Powered by MediaWiki