Polygon Graph Recognition
From MaRDI portal
Recommendations
Cited in
(19)- Recognizing polygons, or how to spy
- Polygon recognition and symmetry detection
- Biconvex graphs: Ordering and algorithms
- Polygon-circle and word-representable graphs
- On polygon numbers of circle graphs and distance hereditary graphs
- Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
- scientific article; zbMATH DE number 6378923 (Why is no real title available?)
- Recognizing weakly simple polygons
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
- Graph classes with structured neighborhoods and algorithmic applications
- Collective additive tree spanners for circle graphs and polygonal graphs
- Graph Drawing
- scientific article; zbMATH DE number 975351 (Why is no real title available?)
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Graph Based Shapes Representation and Recognition
- Intersection graphs of maximal sub-polygons of \(k\)-lizards
- Graphs of intersections of closed polygonal chains
- Independence and domination in polygon graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: Polygon Graph Recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377123)