期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：9
出版社：S.S. Mishra
摘要：A graph G is said to be planar if there exist some geometric representation of graph G which can be drawn on a plane without crossover between its edges. In this paper we find the maximal region decomposition of planar graphs by using the reduction rule for dominating set
关键词：Planar graph; dominating set; region of graphs
