Abstract
Ordinary colourings of cographs are well understood; we focus on more general colourings, known as matrix partitions. We show that all matrix partition problems for cographs admit polynomial time algorithms and forbidden induced subgraph characterizations, even for the list version of the problems. Cographs are the largest natural class of graphs that have been shown to have this property. We bound the size of a biggest minimal Mobstruction cograph G, both in the presence of lists, and (with better bounds) without lists. Finally, we improve these bounds when either the matrix M, or the cograph G, is restricted.
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
A. Brandstädt, Partitions of graphs into one or two stable sets and cliques, Discrete Math. 152 (1996) 47–54.
A. Brandstädt, V.B. Le, and J.P. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Math. and Applications 1999.
K. Cameron, E.M. Eschen, C.T. Hoang, and R. Sritharan, The list partition problem for graphs, SODA 2004.
D.G. Corneil, H. Lerchs, and L. Stewart Burlingham, Complement reducible graphs, Discrete Applied Math. 3 (1981) 163–174.
D.G. Corneil, Y. Perl, and L.K. Stewart, A linear recognition algorithm for cographs, SIAM. J. Computing 14 (1985) 926–934.
M. Demange, T. Ekim, and D. de Werra, Partitioning cographs into cliques and stable sets, Discrete Optimization 2 (2005) 145–153.
C.M.H. de Figueiredo, S. Klein, Y. Kohayakawa, and B.A. Reed, Finding skew partitions efficiently, Journal of Algorithms 37 (2000) 505–521.
T. Feder and P. Hell, On realizations of point determining graphs, and obstructions to full homomorphisms, manuscript 2004.
T. Feder and P. Hell, Matrix partitions of perfect graphs, Claude Berge Memorial Volume (2004).
T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of list partitions, Proc. 31st Ann. ACM Symp. on Theory of Computing (1999) 464–472.
T. Feder, P. Hell, S. Klein, and R. Motwani, List partitions, SIAM J. on Discrete Math. 16 (2003) 449–478.
T. Feder, P. Hell, S. Klein, L. Tito Nogueira, and F. Protti, List matrix partitions of chordal graphs, LATIN 2004, Lecture Notes in Computer Science 2976 (2004) 100–108.
T. Feder, P. Hell, S. Klein, L. Tito Nogueira, and F. Protti, List matrix partitions of chordal graphs. Theoretical Computer Science 349 (2005) 52–66.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
P. Hell, S. Klein, L.T. Nogueira, F. Protti, Partitioning chordal graphs into independent sets and cliques, Discrete Applied Math. 141 (2004) 185–194.
P. Hell, S. Klein, L.T. Nogueira, F. Protti, Packing r-cliques in weighted chordal graphs, Annals of Operations Research 138, No. 1 (2005) 179–187.
P. Hell and J. Nešetřil, Graphs and Homomorphisms, Oxford University Press, 2004.
S. Seinsche, On a property of the class of n-colourable graphs, J. Combin. Theory B 16 (1974) 191–193.
R. de Souza Francisco, S. Klein, and L. Tito Nogueira, Characterizing (k, ℓ)-partitionable cographs, Electronic Notes in Discrete Mathematics 22 (2005), 277–280.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Birkhäuser Verlag Basel/Switzerland
About this chapter
Cite this chapter
Feder, T., Hell, P., Hochstättler, W. (2006). Generalized Colourings (Matrix Partitions) of Cographs. In: Bondy, A., Fonlupt, J., Fouquet, JL., Fournier, JC., Ramírez Alfonsín, J.L. (eds) Graph Theory in Paris. Trends in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7400-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-7643-7400-6_12
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7228-6
Online ISBN: 978-3-7643-7400-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)