Recognizing Polar Planar Graphs Using New Results for Monopolarity
Polar and monopolar graphs are natural generalizations of bipartite or split graphs. A graph G = (V,E) is polar if its vertex set admits a partition V = A ∪ B such that A induces a complete multipartite and B the complement of a complete multipartite graph. If A is even a stable set then G is called monopolar.
Recognizing general polar or monopolar graphs is NP-complete and, as yet, efficient recognition is available only for very few graph classes.
This paper considers monopolar and polar graphs that are also planar. On the one hand, we show that recognizing these graphs remains NP-complete, on the other hand we identify subclasses of planar graphs on which polarity and monopolarity can be checked efficiently. The new NP-completeness results cover very restricted graph classes and are sharper than all previous known cases. On the way to the positive results, we develop new techniques for efficient recognition of subclasses of monopolar graphs. These new results extend nearly all known results for efficient monopolar recognition.
KeywordsPlanar Graph Chordal Graph Graph Class Free Graph Split Graph
Unable to display preview. Download preview PDF.
- 5.Churchley, R., Huang, J.: Line-polar graphs: characterization and recognition (2009) (manuscript); SIAM Journal on Discrete Mathematics (accepted)Google Scholar
- 6.Churchley, R., Huang, J.: The polarity and monopolarity of claw-free graphs (2010) (manuscript) (submitted for publication)Google Scholar
- 12.Ekim, T., Huang, J.: Recognizing line-polar bipartite graphs in time O(n). Discrete Appl. Math. (2010)Google Scholar
- 15.Farrugia, A.: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electron. J. Combin. 11, #R46 (2004)Google Scholar
- 17.Laroche, P.: Planar 1-in-3 satisfiability is NP-complete. In: ASMICS Workshop on Tilings, Deuxième Journées Polyominos et pavages, Ecole Normale Supérieure de Lyon (1992)Google Scholar
- 19.Mulzer, W., Rote, G.: Minimun-Weight Triangulation is NP-hard. J. ACM 55, Article No. 11 (2008)Google Scholar