scientific article; zbMATH DE number 975351

zbMATH Open0862.05065MaRDI QIDQ5284020FDOQ5284020

Authors: Ehab S. Elmallah, Lorna Stewart 

Publication date: 9 March 1997

Title of this publication is not available (Why is that?)

Recommendations

• Independence and domination in polygon graphs
• Polygon Graph Recognition
• The complexity of domination problems in circle graphs

zbMATH Keywords

dominating setdominationpermutation graphspolynomial time exact algorithms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (7)

• Independence and domination in polygon graphs
• Total domination in plane triangulations
• On dominating set of some subclasses of string graphs
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• On the dominating set polytope
• On the \(k\)-dominating set polytope of web graphs
• Connected domination

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284020)