Covering and coloring polygon-circle graphs (Q1356563): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56503310, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of multiple interval graphs and overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thresholds for classes of intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832590 / rank
 
Normal rank

Latest revision as of 14:10, 27 May 2024

scientific article
Language Label Description Also known as
English
Covering and coloring polygon-circle graphs
scientific article

    Statements

    Covering and coloring polygon-circle graphs (English)
    0 references
    0 references
    0 references
    24 September 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    overlap graphs
    0 references
    intersection graphs
    0 references
    polygons
    0 references
    binding functions
    0 references
    chromatic number
    0 references
    clique covering number
    0 references
    polygon-circle graphs
    0 references
    independence numbers
    0 references
    circle graphs
    0 references
    0 references