Abstract
In this paper, we present results on two subclasses of trapezoid graphs, including simple trapezoid graphs and triangle graphs (also known as PI graph in [3]). Simple trapezoid graphs and triangle graphs are proper subclasses of trapezoid graphs [5, 3]. Here we show that simple trapezoid graphs and triangle graphs are also two distinct subclasses of trapezoid graphs.
Further, given the triangle representation and assuming that upper vertices of the triangles are listed in sorted order, we show that optimization problems on triangle graphs including finding the maximum independent set and minimum clique partition can be found in O(n log α) time where α is the size of the largest independent set. The maximum clique and minimum vertex coloring in triangle graphs can be found in O(n log χ) where χ is the chromatic number of the underlying triangle graph.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.P. Bogart, G. Isaak, L. Langley, and P.C. Fishburn. Proper and unit tolerance graphs. Technical Report 91-74, DIMACS, November 1991.
T. Corman, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990.
D.G. Corneil and P.A. Kamula. Extensions of permutation and interval graphs. In Proc. 18th Southeastern Conference on Combinatorics, Graph theory and Computing, pages 267–276, 1987.
I. Dagan, M.C. Golumbic, and R.Y. Pinter. Trapezoid graphs and their coloring. Discr. Applied Math., 21:35–46, 1988.
S. Felsner. Tolerance graphs and orders. In E.W. Mayr, editor, Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci WG 92, Lecture Notes in Computer Science 657, pages 17–26. Springer-Verlag, 1992.
S. Felsner, R. Müller, and L. Wernisch. Optimal algorithms for trapezoid graphs. Technical Report 368, Technische Universität Berlin, 1993.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
M.C. Golumbic and C.L. Monma. A generalization of interval graphs with tolerances. Congr. Numer., 35:321–331, 1982.
D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1968.
T.-H. Ma and J.P. Spinrad. An O(n2) time algorithm for the 2-chain cover problem and related problems. In Proc. 2nd ACM-SIAM Symp. Discrete Algorithms, pages 363–372, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, Y.L. (1994). Triangle graphs and their coloring. In: Bouchitté, V., Morvan, M. (eds) Orders, Algorithms, and Applications. ORDAL 1994. Lecture Notes in Computer Science, vol 831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019431
Download citation
DOI: https://doi.org/10.1007/BFb0019431
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58274-8
Online ISBN: 978-3-540-48597-1
eBook Packages: Springer Book Archive