Classes of graphs with small rank decompositions are \(\chi \)-bounded (Q412260): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring polygon-circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank

Latest revision as of 03:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Classes of graphs with small rank decompositions are \(\chi \)-bounded
scientific article

    Statements

    Classes of graphs with small rank decompositions are \(\chi \)-bounded (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    chi-bounded
    0 references
    chromatic number
    0 references
    clique number
    0 references
    bounded rank-width
    0 references
    clique width
    0 references

    Identifiers

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