Independence and domination in polygon graphs

DOI10.1016/0166-218X(93)90222-AMaRDI QIDQ686246zbMATH OpenOpenAlexFDO

Authors 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

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)

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

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

(10)

• Domination and total domination on asteroidal triple-free graphs
• Parameterized domination in circle graphs
• Graph classes with structured neighborhoods and algorithmic applications
• On polygon numbers of circle graphs and distance hereditary graphs
• Semitotal domination on AT-free graphs and circle graphs
• Intersection graphs of maximal sub-polygons of \(k\)-lizards
• Graph classes with structured neighborhoods and algorithmic applications
• Parameterized Complexity of Independence and Domination on Geometric Graphs
• Bichain graphs: geometric model and universal graphs
• Graph Drawing

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)