Abstract
A graph G is a general partition graph if there is some set S and an assignment of non-empty subsets S x ⊆ S to the vertices of G such that two vertices x and y are adjacent if and only if S x ∩ S y ≠ Ø and for every maximal independent set M the set {S m | m ∈ M} is a partition of S. For every minor closed family of graphs there exists a polynomial time algorithm that checks if an element of the family is a general partition graph.
The triangle condition says that for every maximal independent set M and for every edge (x,y) with x,y ∉ M there is a vertex m ∈ M such that {x,y,m} induces a triangle in G. It is known that the triangle condition is necessary for a graph to be a general partition graph (but in general not sufficient). We show that for AT-free graphs this condition is also sufficient and this leads to an efficient algorithm that demonstrates whether or not an AT-free graph is a general partition graph.
We show that the triangle condition can be checked in polynomial time for planar graphs and circle graphs. It is unknown if the triangle condition is also a sufficient condition for planar graphs to be a general partition graph. For circle graphs we show that the triangle condition is not sufficient.
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
Anbeek, C., DeTemple, D., McAvaney, K., Robertson, J.: When are chordal graphs also partition graphs? Australas. J. Combin. 16, 285–293 (1997)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes–A Survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)
Broersma, H.J., Kloks, T., Kratsch, D., Müller, H.: Independent sets in AT-free graphs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 760–770. Springer, Heidelberg (1997)
Bron, S., Kerbosch, J.: Algorithm 457–Finding all cliques of an undirected graph. Comm. of ACM 16, 575 (1973)
Chvátal, V., Slater, P.J.: A note on well-covered graphs. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory? Annals of Discrete Mathematics, vol. 55, pp. 179–182 (1993)
Corneil, D.G., Olariu, S., Stewart, L.K.: Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics 10, 399–430 (1997)
DeTemple, D.W., Dineen, M.J., Robertson, J.M., McAvaney, K.L.: Recent examples in the theory of partition graphs. Discrete Mathematics 113, 255–258 (1993)
DeTemple, D., Harary, F., Robertson, J.: Partition graphs. Soochow J. Math. 13, 121–129 (1987)
DeTemple, D.W., Robertson, J.M.: Constructions and the realization problem for partition graphs. J. Combin. Inform. System Sci. 13, 50–63 (1988)
DeTemple, D., Robertson, J., Harary, F.: Existential partition graphs. J. Combin. Inform. System Sci. 9, 193–196 (1984)
Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 30, 261–273 (1973)
Kloks, T.: Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994)
Kloks, T., Kratsch, D., Lee, C.M., Liu, J.: Improved bottleneck domination algorithms (2003) (manuscript)
Lekkerkerker, C., Boland, D.: Representation of finite graphs by a set of intervals on the real line. Fund. Math. 51, 45–64 (1962)
McAvaney, K., Robertson, J., DeTemple, D.: A characterization and hereditary properties for partition graphs. Discrete Mathematics 113, 131–142 (1993)
Naji, W.: Reconnaissance des graphes de cordes. Discrete Mathematics 54, 329–337 (1985)
Nebeský, L.: On partition graphs and generalizations of line graphs. Časopis Pěst. Mat. 102, 203–205 (1977)
Robertson, N., Seymour, P.D.: Graph minors–A Survey. In: Anderson, I. (ed.) Surveys in Combinatorics, pp. 153–171. Cambridge University Press, Cambridge (1985)
Spinrad, J.P.: Recognition of circle graphs. J. Algorithms 16, 264–282 (1994)
Tsukiyama, S.: Algorithms for generating all maximal independent sets. Electronics & Communications 59, 1–8 (1976)
Yen, W.C.-K.: Bottleneck domination and bottleneck independent domination on graphs. Journal of Information Science and Engineering 18, 311–331 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kloks, T., Lee, CM., Liu, J., Müller, H. (2003). On the Recognition of General Partition Graphs. In: Bodlaender, H.L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2003. Lecture Notes in Computer Science, vol 2880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39890-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-39890-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20452-7
Online ISBN: 978-3-540-39890-5
eBook Packages: Springer Book Archive