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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 18:55, 5 March 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