Abstract
Let k be a natural number. A graph is k-distance hereditary if it has a tree-decomposition such that every cutmatrix has a block structure that is some submatrix of where I k is the k ×k identity matrix. We characterize k-distance hereditary graphs and we show that for fixed k there exists an O(n 3) time algorithm that recognizes the graphs in this class.
Chapter PDF
Similar content being viewed by others
References
Bouchet, A.: An efficient algorithm to recognize locally equivalent graphs. Combinatorica 11, 315–329 (1991)
Cameron, P.J.: Two-graphs and trees. Discrete Mathematics 127, 63–74 (1994)
Chang, M.-S., Hsieh, S.-Y., Chen, G.-H.: Dynamic programming on distance-hereditary graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 344–353. Springer, Heidelberg (1997)
Corneil, D.G., Lerchs, H., Stewart–Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3, 163–174 (1981)
Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society 2, 326–336 (1952)
Howorka, E.: A characterization of distance-hereditary graphs. Quarterly Journal of Mathematics 28, 417–420 (1977)
Hung, L.-J., Kloks, T.: de Bruijn’s combinatorics. Manuscript (2009), http://www.cs.ccu.edu.tw/~hunglc/combinatorics.pdf
Hung, L.-J., Kloks, T.: On some simple widths. In: Rahman, M. S. (ed.) WALCOM 2010. LNCS, vol. 5942, pp. 204–215. Springer, Heidelberg (2009)
Hung, L.-J., Kloks, T.: Kruskalian graphs; k-cographs. In: Proceedings of CATS 2010. CRPIT, vol. 109, pp. 49–53 (2010)
Kruskal, J.: Well-quasi-ordering, the tree theorem, and Vazsonyi’s conjecture. Transactions of the American Mathematical Society 95, 210–225 (1960)
Milner, E.C.: Basic WQO– and BQO-theory. In: Rival, I. (ed.) Graphs and Orders, pp. 487–502. D. Reidel Publishing Company, Dordrecht (1985)
Oum, S.: Graphs of bounded rank-width, PhD Thesis. Princeton University (2005)
Pouzet, M.: Applications of well-quasi-ordering and better-quasi-ordering. In: Rival, I. (ed.) Graphs and Orders, pp. 503–519. D. Reidel Publishing Company, Dordrecht (1985)
Seidel, J.J.: Geometry and combinatorics. In: Corneil, D.G., Mathon, R. (eds.) Selected works of J.J. Seidel. Academic Press, London (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hung, LJ., Kloks, T. (2010). Classifying Rankwidth k-DH-Graphs. In: Ablayev, F., Mayr, E.W. (eds) Computer Science – Theory and Applications. CSR 2010. Lecture Notes in Computer Science, vol 6072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13182-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-13182-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13181-3
Online ISBN: 978-3-642-13182-0
eBook Packages: Computer ScienceComputer Science (R0)