Independence and domination in polygon graphs

DOI10.1016/0166-218X(93)90222-AzbMATH Open0785.68072OpenAlexW1971604681MaRDI QIDQ686246FDOQ686246

Ehab S. Elmallah, Lorna Stewart

Publication date: 28 November 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90222-a

Recommendations

• scientific article; zbMATH DE number 975351
• Polygon Graph Recognition
• The complexity of domination problems in circle graphs
• scientific article; zbMATH DE number 1534394
• Graph Drawing

zbMATH Keywords

minimum dominating setmaximum \(r\)-colorable subgraphpolygon graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• The Complexity of Coloring Circular Arcs and Chords
• Algorithms for a maximum clique and a maximum independent set of a circle graph
• Recognizing circle graphs in polynomial time
• The complexity of domination problems in circle graphs
• Title not available (Why is that?)
• Domination in permutation graphs

Cited In (9)

• Parameterized domination in circle graphs
• Semitotal domination on AT-free graphs and circle graphs
• Graph classes with structured neighborhoods and algorithmic applications
• Bichain graphs: geometric model and universal graphs
• Graph Classes with Structured Neighborhoods and Algorithmic Applications
• 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
• 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)