Almost all string graphs are intersection graphs of plane convex sets

DOI10.4230/LIPICS.SOCG.2018.68MaRDI QIDQ5116528zbMATH OpenOpenAlexFDO

Authors

Publication date 18 August 2020

Full work available at URL https://arxiv.org/pdf/1803.06710.pdf

zbMATH Keywords

intersection graphstring graphplane convex set

Mathematics Subject Classification ID

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)

Recommendations

• Almost all string graphs are intersection graphs of plane convex sets
• A separator theorem for string graphs and its applications
• A Separator Theorem for String Graphs and Its Applications
• scientific article; zbMATH DE number 3981198
• On string graph limits and the structure of a typical string graph

Cites work

• scientific article; zbMATH DE number 3557819 (Why is no real title available?)
• scientific article; zbMATH DE number 970795 (Why is no real title available?)
• scientific article; zbMATH DE number 3027510 (Why is no real title available?)
• Almost all Berge Graphs are Perfect
• Almost all string graphs are intersection graphs of plane convex sets
• Decidability of string graphs
• Excluding Induced Subgraphs III: A General Asymptotic
• Excluding induced subgraphs. II: Extremal graphs
• Excluding induced subgraphs: critical graphs
• How many ways can one draw a graph?
• On string graph limits and the structure of a typical string graph
• On the entropy values of hereditary classes of graphs
• Projections of Bodies and Hereditary Properties of Hypergraphs
• Recognizing string graphs in NP
• String graphs requiring exponential representations
• String graphs. II: Recognizing string graphs is NP-hard
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The fine structure of octahedron-free graphs
• The number of graphs without forbidden subgraphs
• The structure of almost all graphs in a hereditary property
• The typical structure of graphs without given excluded subgraphs
• Topology of Thin Film RC Circuits
• Toward a theory of crossing numbers
• Über wesentlich unplättbare Kurven im dreidimensionalen Raume

Cited in

(5)

• Almost all string graphs are intersection graphs of plane convex sets
• Ordered graphs and large bi-cliques in intersection graphs of curves
• scientific article; zbMATH DE number 6381690 (Why is no real title available?)
• On string graph limits and the structure of a typical string graph
• Almost all string graphs are intersection graphs of plane convex sets

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)