Almost all string graphs are intersection graphs of plane convex sets
From MaRDI portal
Publication:5116528
DOI10.4230/LIPICS.SOCG.2018.68zbMATH Open1489.05120OpenAlexW2964212140MaRDI QIDQ5116528FDOQ5116528
Author name not available (Why is that?)
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/pdf/1803.06710.pdf
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Projections of Bodies and Hereditary Properties of Hypergraphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The number of graphs without forbidden subgraphs
- The typical structure of graphs without given excluded subgraphs
- Title not available (Why is that?)
- The fine structure of octahedron-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognizing string graphs in NP
- How many ways can one draw a graph?
- Excluding Induced Subgraphs III: A General Asymptotic
- On the entropy values of hereditary classes of graphs
- Excluding induced subgraphs. II: Extremal graphs
- The structure of almost all graphs in a hereditary property
- Topology of Thin Film RC Circuits
- Excluding induced subgraphs: Critical graphs
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs requiring exponential representations
- Decidability of string graphs
- Toward a theory of crossing numbers
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Almost all Berge Graphs are Perfect
- On String Graph Limits and the Structure of a Typical String Graph
- Almost all string graphs are intersection graphs of plane convex sets
Cited In (3)
This page was built for publication: Almost all string graphs are intersection graphs of plane convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116528)
