Interval bigraphs and circular arc graphs

Journal of Graph Theory

Volumn 46, Issue 4, 2004, Pages 313-327

  Hell, Pavol ^a   Huang, Jing ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Asteroidal triples; Circular arc graphs; Edge asteroids; Interval bigraphs; Interval graphs; Proper circular arc graphs; Proper interval bigraphs; Proper interval graphs

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DIFFERENTIAL EQUATIONS; MATHEMATICAL OPERATORS; SET THEORY;

ASTEROIDAL TRIPLES; CIRCULAR ARC GRAPHS; EDGE ASTEROIDS; INTERVAL BIGRAPHS; INTERVAL GRAPHS; PROPER CIRCULAR ARC GRAPHS; PROPER INTERVAL BIGRAPHS; PROPER INTERVAL GRAPHS;

GRAPH THEORY;

EID: 3843051215     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20006     Document Type: Article

References (36)

1. K. S. Booth and G. S. Lueker, Testing for the consecutive ones property using PQ-tree algorithms, J Comput Syst Sci 13 (1976), 335-379.
2. A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes, SIAM Monographs Discrete Math and Applications, Philadelphia, 1999.
3. D. E. Brown, J. R. Lundgren, and C. Miller, Variations on interval graphs, Congressus Num 149 (2001), 77-95.
4. D. E. Brown, J. R. Lundgren, and S. C. Flink, Characterizations of interval bigraphs and unit interval bigraphs, Congressus Num 157 (2002), 79-93.
5. D. E. Brown and J. R. Lundgren, Several characterizations of unit interval bigraphs, manuscript 2003.
6. D. G. Corneil, A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs, manuscript 2002.
7. D. G. Corneil, H. Kim, S. Natarajan, S. Olariu, and A. P. Sprague, Simple linear time recognition of unit interval graphs, Inform Process Lett 55 (1995), 99-104.
8. D. G. Corneil, S. Olariu, and L. Stewart, A multipass LBFS algorithm for the recognition of interval graphs, manuscript 2000.
9. X. Deng, P. Hell, and J. Huang, Linear time representation of proper circular arc graphs and proper interval graphs, SIAM J Comput 25 (1996), 390-403.
10. T. Feder and P. Hell, List homomorphisms to reflexive graphs, J Combin Theory B 72 (1998), 236-250.
11. T. Feder, P. Hell, and J. Huang, List homomorphisms and circular arc graphs, Combinatorica 19 (1999), 487-505.
12. T. Feder, P. Hell, and J. Huang, Bi-arc graphs and the complexity of list homomorphisms, J Graph Theory 42 (2003), 61-80.
13. T. Gallai, Transitiv orientbare Graphen, Acta Math Acad Sci Hungar 18 (1967), 25-66.
14. M. C. Golumbic and A. Trenk, Tolerance Graphs, Cambridge University Press, 2004.
15. F. Harary, J. A. Kabell, and F. R. McMorris, Bipartite intersection graphs, Comment, Math Universitatis Carolinae 23 (1982), 739-745.
16. P. Hell and J. Huang, Two remarks on circular arc graphs, Graphs and Combinatorics 13 (1997), 65-72.
17. P. Hell and J. Huang, Certifying LexBFS recognition algorithms for proper interval graphs, and proper interval bigraphs, manuscript 2003.
18. W. L. Hsu, A simple test for the consecutive ones property, J Algorithms 43 (2002) 1-16.
19. C. G. Lekkerkerker and J. Ch. Boland, Representation of a finite graph by a set of intervals on the real line, Fund Math 51 (1962), 45-64.
20. I. J. Lin, M. K. Sen, and D. B. West, Classes of interval digraphs and 01-matrices, Congressus Num 125 (1997), 201-209.
21. R. Lundgren, Variations on interval graphs, presentation at the SIAM Conference on Discrete Mathematics, San Diego, August 2002.
22. R. M. McConnell, Linear-time recognition of circular arc graphs, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS01) 42, 2001.
23. H. Müller, Recognizing interval digraphs and interval bigraphs in polynomial time, Discrete Appl Math 78 (1997), 189-205. Erratum, http://www.comp.leeds.ac.uk/hm/publ.html.
24. E. Prisner, A journey through intersection graph county, web manuscript, http://www.math.uni-hamburg.de/spag/gd/mitarbeiter/prisner/Pris/Rahmen.html.
25. B. K. Sanyal and M. K. Sen, New characterizations of digraphs represented by intervals, J Graph Theory 22 (1996), 297-303.
26. M. Sen, A. Basu, and S. Das, Bigraphs of Ferrers dimension two and circular arc graphs, manuscript 2003.
27. M. Sen, S. Das, A. B. Roy, and D. B. West, Interval digraphs: An analogue of interval graphs, J Graph Theory 13 (1989), 189-202.
28. J. Spinrad, Circular-arc graphs with clique cover number two, J Combin Theory B (1988), 300-306.
29. J. Spinrad, web manuscript of a book, http://www.vuse.vanderbilt.edu/ spin/book.ps (see section 13.4.2).
30. J. Spinrad, A. Brandstädt, and L. Stewart, Bipartite permutation graphs, Discrete Appl Math 18 (1987), 279-292.
31. W. T. Trotter and J. I. Moore, Characterization problems for graphs, partially ordered sets, lattices, and families of sets, Discrete Math 16 (1976), 361-381.
32. A. Tucker, Structure theorems for some circular arc graphs, Discrete Math 7 (1974), 167-195.
33. A. Tucker, Matrix characterization of circular arc graphs, Pacific J Math 39(2) (1971), 535-545.
34. A. Tucker, An efficient test for circular arc graphs, SIAM J Comput 9 (1980), 1-24.
35. n, Ph.D. thesis, Universität Gottigen, Gottingen, Germany, 1967.
36. D. B. West, Short proofs for interval digraphs, Discrete Math 178 (1998), 287-292.