Contact Graphs of Circular Arcs
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Recommendations
- Partial characterizations of circular-arc graphs
- Partial Characterizations of Circular-Arc Graphs
- Classes and recognition of curve contact graphs
- Proper circular arc graphs as intersection graphs of paths on a grid
- Circumdetic graphs
- On some subclasses of circular-arc graphs
- Paths in interval graphs and circular arc graphs
- scientific article; zbMATH DE number 3970805
- Circular‐arc digraphs: A characterization
- On chordal proper circular arc graphs
Cites work
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- A bijection for triangulations, quadrangulations, pentagulations, etc.
- Algorithms – ESA 2004
- An inductive construction of (2,1)-tight graphs
- Area-universal and constrained rectangular layouts
- Balanced circle packings for planar graphs
- Barycentric systems and stretchability
- Classes and recognition of curve contact graphs
- Contact Graphs of Circular Arcs
- Drawing graphs with few arcs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Minimum-weight triangulation is NP-hard
- On topological aspects of orientations
- Pebble game algorithms and sparse graphs
- Planar minimally rigid graphs and pseudo-triangulations
- Proportional Contact Representations of Planar Graphs
- Representations by contact and intersection of segments
- Triangle contact representations and duality
- Triangle-Free Planar Graphs and Segment Intersection Graphs
Cited in
(7)- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
- Square-contact representations of partial 2-trees and triconnected simply-nested graphs
- Topological inductive constructions for tight surface graphs
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
- Classes and recognition of curve contact graphs
- Contact Graphs of Circular Arcs
This page was built for publication: Contact Graphs of Circular Arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449800)
