Unit interval graphs of open and closed intervals

Journal of Graph Theory

Volumn 72, Issue 4, 2013, Pages 418-429

  Rautenbach, Dieter ^a   Szwarcfiter, Jayme L ^b  

^a UNIVERSITY OF ULM   (Germany)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

intersection graph; interval graph; proper interval graph; unit interval graph

Indexed keywords

FINITE INTERSECTIONS; INTERSECTION GRAPH; INTERVAL GRAPH; PROPER INTERVAL GRAPHS; REAL INTERVALS; STRUCTURAL CHARACTERIZATION; UNIT INTERVAL GRAPHS;

GRAPH THEORY;

EID: 84873736499     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.21650     Document Type: Article

References (17)

1. K. P. Bogart, and, D. B. West, A short proof that "proper=unit ", Discrete Math 201 (1999), 21-23.
2. A. Brandstädt, V. B. Le, and, J. P. Spinrad, Graph classes: A survey, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1999.
3. D. G. Corneil, A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs, Discrete Appl Math 138 (2004), 371-379.
4. D. G. Corneil, H. Kim, S. Natarajan, S. Olariu, and, A. P. Sprague, Simple linear time recognition of unit interval graphs, Inf Process Lett 55 (1995), 99-104.
5. D. G. Corneil, S. Olariu, and, L. Stewart, The ultimate interval graph recognition algorithm? (Extended abstract), Proceedings of the 9th annual ACM-SIAM symposium on Discrete algorithms (SODA), 1998, pp. 175-180.
6. P. C. Fishburn, Interval orders and interval graphs. A study of partially ordered sets. John Wiley & Sons, New York, 1985.
7. P. Frankl, and, H. Maehara, Open-interval graphs versus closed-interval graphs, Discrete Math 63 (1987), 97-100.
8. P. W. Goldberg, M. C. Golumbic, H. Kaplan, and, R. Shamir, Four strikes against physical mapping of DNA, J Comput Biol 2 (1995), 139-152.
9. M. C. Golumbic, Algorithmic graph theory and perfect graphs, vol. 57. Annals of Discrete Mathematics, Amsterdam, The Netherlands, 2004.
10. P. Hell, R. Shamir, and, R. Sharan, A fully dynamic algorithm for recognizing and representing proper interval graphs, SIAM J Comput 31 (2001), 289-305.
11. C. M. Herrera de Figueiredo, J. Meidanis, and, C. Picinin de Mello, A linear-time algorithm for proper interval graph recognition, Inf Process Lett 56 (1995), 179-184.
12. H. Kaplan, and, R. Shamir, Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques, SIAM J Comput 25 (1996), 540-561.
13. D. G. Kendall, Incidence matrices, interval graphs, and seriation in archaeology, Pacific J Math 28 (1969), 565-570.
14. C. H. Papadimitriou, and, M. Yannakakis, Scheduling interval-ordered tasks, SIAM J Comput 8 (1979), 405-409.
15. F. S. Roberts, Indifference graphs, in Proof techniques in graph theory, F. Harary, (Editor), Academic Press, 1969, pp. 139-146
16. S. B. Sadjad, and, H. Z. Zadeh, Unit interval graphs, properties and algorithms, School of Computer Science, Technical Report, University of Waterloo, February 2004.
17. A. Tucker, Structure theorems for some classes of circular-arc graphs, Discrete Math 7 (1974), 167-195.