Independence and domination in polygon graphs
From MaRDI portal
(Redirected from Publication:686246)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3919840 (Why is no real title available?)
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Domination in permutation graphs
- Recognizing circle graphs in polynomial time
- The Complexity of Coloring Circular Arcs and Chords
- The complexity of domination problems in circle graphs
Cited in
(11)- Graph classes with structured neighborhoods and algorithmic applications
- Semitotal domination on AT-free graphs and circle graphs
- Parameterized domination in circle graphs
- Graph classes with structured neighborhoods and algorithmic applications
- Graph Drawing
- Bichain graphs: geometric model and universal graphs
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- Domination and total domination on asteroidal triple-free graphs
- On polygon numbers of circle graphs and distance hereditary graphs
- Polygon Graph Recognition
- Intersection graphs of maximal sub-polygons of \(k\)-lizards
This page was built for publication: Independence and domination in polygon graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686246)