Abstract
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(n 2 m)-time algorithm which determines whether a graph G on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this class of graphs.
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
Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Combin. Theory B 41, 182–208 (1986)
Brandstädt, A., Dragan, F.F., Nicolai, F.: Homogeneously orderable graphs. Theoret. Comput. Sci. 172, 209–232 (1997)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)
Chvátal, V.: Perfectly ordered graphs. Annals of Discrete Math. 21, 63–65 (1984)
Chvátal, V.: A class of perfectly orderable graphs, Report 89573-OR, Forschungsinstitut für Diskrete Mathematik, Bonn (1989)
Chang, G.J.: k-Domination and Graph Covering Problems, Ph.D Thesis, School of OR and IE, Cornell University, Ithaca, NY (1982)
D’Atri, A., Moscarini, M., Sassano, A.: The Steiner tree problem and homogeneous sets. Lecture Notes in Comput. Sci. 324, 249–261 (1988)
Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43, 173–189 (1983)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., London (1980)
Hayward, R.: Meyniel weakly triangulated graphs I: co-perfect orderability. Discrete Appl. Math. 73, 199–210 (1997)
Hoàng, C.T., Khouzam, N.: On brittle graphs. J. Graph Theory 12, 391–404 (1988)
Hoàng, C.T., Sritharan, R.: Finding houses and holes in graphs. Theoret. Comput. Sci. 259, 233–244 (2001)
Middendorf, M., Pfeiffer, F.: On the complexity of recognizing perfectly orderable graphs. Discrete Math. 80, 327–333 (1990)
Nikolopoulos, S.D., Palios, L.: Recognizing HHD-free and Welsh-Powell opposition graphs. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 105–116. Springer, Heidelberg (2004)
Nikolopoulos, S.D., Palios, L.: Recognizing HHD-free and Welsh-Powell opposition graphs, Technical Report TR-16-04, Dept. of Computer Science, University of Ioannina (2004)
Olariu, S.: All variations on perfectly orderable graphs. J. Combin. Theory Ser. B 45, 150–159 (1988)
Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266–283 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikolopoulos, S.D., Palios, L. (2005). Recognizing HHDS-Free Graphs. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_40
Download citation
DOI: https://doi.org/10.1007/11604686_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)