Sparse Graphs Are Near-Bipartite (Q5130577): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3048715473 / rank
 
Normal rank

Latest revision as of 10:14, 30 July 2024

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

    Sparse Graphs Are Near-Bipartite (English)
    0 references
    0 references
    0 references
    28 October 2020
    0 references
    near-bipartite graph
    0 references
    potential method
    0 references
    4-critical graph
    0 references
    coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references