scientific article; zbMATH DE number 975351

MaRDI QIDQ5284020zbMATH OpenFDO

Authors Ehab S. Elmallah, Lorna Stewart

Publication date 9 March 1997

zbMATH Keywords

dominating setdominationpermutation graphspolynomial time exact algorithms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

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

Cited in

(8)

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

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)