Abstract
Polar graphs generalise bipartite, cobipartite, split graphs, and they constitute a special type of matrix partitions. A graph is polar if its vertex set can be partitioned into two, such that one part induces a complete multipartite graph and the other part induces a disjoint union of complete graphs. Deciding whether a given arbitrary graph is polar, is an NP-complete problem. Here we show that for permutation graphs this problem can be solved in polynomial time. The result is surprising, as related problems like achromatic number and cochromatic number are NP-complete on permutation graphs. We give a polynomial-time algorithm for recognising graphs that are both permutation and polar. Prior to our result, polarity has been resolved only for chordal graphs and cographs.
This work is supported by the Research Council of Norway.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308–340 (1991)
Bodlaender, H.: Achromatic number is NP-complete for cographs and interval graphs. Information Processing Letters 31, 135–138 (1989)
Bodlaender, H.L., Kloks, T., Kratsch, D.: Treewidth and pathwidth of permutation graphs. SIAM Journal on Discrete Mathematics 8, 606–616 (1995)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM, Philadelphia (1999)
Brown, J.I., Corneil, D.G.: On generalized graph colorings. Journal of Graph Theory 11, 87–99 (1987)
Chernyak, Z.A., Chernyak, A.A.: About recognizing (α, β)-classes of polar graphs. Discrete Mathematics 62, 133–138 (1986)
Courcelle, B.: The monadic second-order logic of graphs. III. Tree-decompositions, minors and complexity issues. RAIRO Inform. Theor. Appl. 26, 257–286 (1992)
Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33, 125–150 (2000)
Ekim, T.: Polarity of claw-free graphs (submitted)
Ekim, T., Hell, P., Stacho, J., de Werra, D.: Polarity of chordal graphs. Discrete Applied Mathematics 156, 2469–2479 (2008)
Ekim, T., Huang, J.: Recognizing line-polar bipartite graphs (manuscript)
Ekim, T., Mahadev, N.V.R., de Werra, D.: Polar cographs. Discrete Applied Mathematics 156, 1652–1660 (2008)
Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of graph partition problems. In: Proceedings of STOC 1999, pp. 464–472 (1999)
Fomin, F.V., Kratsch, D., Novelli, J.-C.: Approximating minimum cocolorings. Information Processing Letters 84, 285–290 (2002)
Gagarin, A.V.: Chordal (1, β)-polar graphs. Vestsi Nats. Akad. Navuk Belarusi Ser. Fiz.-Mat. Navuk 143, 115–118 (1999)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. North-Holland, Amsterdam (2004)
Golumbic, M.C., Rotics, U.: On the Clique-Width of Some Perfect Graph Classes. International Journal of Foundations of Computer Science 11, 423–443 (2000)
Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica 1, 275–284 (1981)
Hell, P., Klein, S., Nogueira, L.T., Protti, F.: Partitioning chordal graphs into independent sets and cliques. Discrete Applied Mathematics 141, 185–194 (2004)
Huang, J., Xu, B.: A forbidden subgraph characterization of line-polar bipartite graphs (submitted)
Lozin, V.V., Mosca, R.: Polar graphs and maximal independent sets. Discrete Mathematics 306, 2901–2908 (2006)
McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics 201, 189–241 (1999)
Meister, D.: Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 91–102. Springer, Heidelberg (2005)
Melnikov, O.I., Kozhich, P.P.: Algorithms for recognizing the polarity of a graph with bounded parameters. Vestsi Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk 6, 50–54 (1985)
Tyshkevich, R.I., Chernyak, A.A.: Decompositions of Graphs. Cybernetics and System Analysis 21, 231–242 (1985)
Tyshkevich, R.I., Chernyak, A.A.: Algorithms for the canonical decomposition of a graph and recognizing polarity. Izvestia Akad. Nauk BSSR, ser. Fiz. Mat. Nauk 6, 16–23 (1985) (in Russian)
Wagner, K.: Monotonic coverings of finite sets. Elektronische Informationsverarbeitung und Kybernetik 20, 633–639 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ekim, T., Heggernes, P., Meister, D. (2009). Polar Permutation Graphs. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-10217-2_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10216-5
Online ISBN: 978-3-642-10217-2
eBook Packages: Computer ScienceComputer Science (R0)