On the structure of certain intersection graphs (Q845675): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets and cliques in intersection graphs of filaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the divisibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thresholds for classes of intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring polygon-circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a Family of Circular Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank
 
Normal rank

Latest revision as of 10:53, 2 July 2024

scientific article
Language Label Description Also known as
English
On the structure of certain intersection graphs
scientific article

    Statements

    On the structure of certain intersection graphs (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    intersection graphs
    0 references
    computational geometry
    0 references
    chromatic number
    0 references
    perfect graph
    0 references
    polygon-circle graph
    0 references
    interval-filament graph
    0 references
    graph divisibility
    0 references
    0 references