Abstract
Chvátal defined a skew partition of a graph G to be a partition of its vertex set into two non-empty parts A and B such that A induces a disconnected subgraph of G and B induces a disconnected subgraph of \(\overline{G}\). Skew partitions are important in the characterization of perfect graphs. De Figuereido et al. presented a polynomial time algorithm which given a graph either finds a skew partition or determines that no such partition exists. It runs in O(n 101) time. We present an algorithm for the same problem which runs in O(n 4 m) time.
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
Berge, C.: Les problèmes de coloration en théorie des graphes. Publ. Inst. Stat. Univ. Paris 9, 123–160 (1960)
Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics 164, 51–229 (2006)
Chvátal, V.: Star-cutsets and perfect graphs. J. Combin. Theory Ser. B 39, 189–199 (1985)
Chvátal, V., Sbihi, N.: Bull-free berge graphs are perfect. Graphs and Combinatorics 3, 127–139 (1987)
Cornuéjols, G., Cunningham, W.: Compositions for perfect graphs. Discrete Math. 55, 237–246 (1985)
de Figuereido, C.M.H., Klein, S., Kohayakawa, Y., Reed, B.A.: Finding skew partitions efficiently. J. Algorithms 37, 505–521 (2000)
Hoàng, C.: Some properties of minimal imperfect graphs. Discrete Math. 160, 165–175 (1996)
Ramirez-Alfonsin, J., Reed, B.A. (eds.): Perfect graphs. J.H. Wiley, Chichester (2001)
Reed, B.A.: Skew partitions in perfect graphs. In: Discrete Applied Mathematics (2005) (in press)
Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55, 2221–2232 (1985)
Trotignon, N.: Decomposing berge graphs and detecting balanced skew partitions. Journal of Combinatorial Theory Series B 98, 173–225 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kennedy, W.S., Reed, B. (2008). Fast Skew Partition Recognition. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)