Graphs of intersections of closed polygonal chains
From MaRDI portal
Recommendations
Cites work
- Every planar graph is the intersection graph of segments in the plane (extended abstract)
- scientific article; zbMATH DE number 4051024 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3220171 (Why is no real title available?)
- Intersection graphs of curves in the plane
- Intersection graphs of segments
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Order on order types
- String graphs. I: The number of critical nonstring graphs is infinite
- String graphs. II: Recognizing string graphs is NP-hard
- The complexity of domination problems in circle graphs
- The Hamiltonian circuit problem for circle graphs is NP-complete
- The Intrinsic Spread of a Configuration in R d
- Topology of Thin Film RC Circuits
- Universality considerations in VLSI circuits
This page was built for publication: Graphs of intersections of closed polygonal chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669632)