Almost all string graphs are intersection graphs of plane convex sets (Q2189736): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the entropy values of hereditary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of almost all graphs in a hereditary property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of graphs without forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typical structure of graphs without given excluded subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fine structure of octahedron-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding induced subgraphs: Critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projections of Bodies and Hereditary Properties of Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über wesentlich unplättbare Kurven im dreidimensionalen Raume / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On String Graph Limits and the Structure of a Typical String Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding induced even cycles in a graph: typical structure and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5767542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intersection representations of co-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs requiring exponential representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many ways can one draw a graph? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding induced subgraphs: quadrilaterals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all Berge Graphs are Perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding Induced Subgraphs III: A General Asymptotic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding induced subgraphs. II: Extremal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of string graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of Thin Film RC Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank

Revision as of 22:17, 22 July 2024

scientific article
Language Label Description Also known as
English
Almost all string graphs are intersection graphs of plane convex sets
scientific article

    Statements

    Almost all string graphs are intersection graphs of plane convex sets (English)
    0 references
    0 references
    16 June 2020
    0 references
    string graphs
    0 references
    intersection graphs
    0 references
    structure of a typical graph in a hereditary property
    0 references
    0 references
    0 references
    0 references

    Identifiers

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