Recognizing powers of proper interval, split, and chordal graphs

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 1, 2004, Pages 83-102

  Lau, Lap Chi ^a   Corneil, Derek G ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Chordal graphs; Graph algorithms; Graph powers; Graph roots; Proper interval graphs; Split graphs

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; HAMILTONIANS; INTEGER PROGRAMMING; LEAST SQUARES APPROXIMATIONS; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

CHORDAL GRAPHS; GRAPH ALGORITHMS; GRAPH POWERS; GRAPH ROOTS; PROPER INTERVAL GRAPHS; SPLIT GRAPHS;

GRAPH THEORY;

EID: 14644428985     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103425930     Document Type: Article

References (38)

1. R. BALAKRISHNAN AND P. PAULRAJA, Powers of chordal graphs, J. Austral. Math. Soc. Ser. A, 35 (1983), pp. 211-217.
2. A. BRANDSTÄDT, F. DRAGAN, V. CHEPOI, AND V. VOLOSHIN, Dually chordal graphs, SIAM J. Discrete Math., 11 (1998), pp. 437-455.
3. J. M. CHANG, C. W. HO, AND M. T. KO, Powers of asteroidal triple-free graphs with applications, Ars Combin., 67 (2003), pp. 161-173.
4. M. CHUDNOVSKY, N. ROBERTSON, P. SEYMOUR, AND R. THOMAS, The Strong Perfect Graph Theorem, preprint. Available at http://www.math.gatech.edu/ ~thomas/spgc.html.
5. D. G. CORNEIL, A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs, Discrete Appl. Math., 138 (2004), pp. 371-379.
6. P. DAMASCHKE, Distances in cocomparability graphs and their powers, Discrete Appl. Math., 35 (1992), pp. 67-72.
7. X. DENG, P. HELL, AND J. HUANG, Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs, SIAM J. Comput., 25 (1996), pp. 390-403.
8. P. DUCHET, Classical perfect graphs, Ann. Discrete Math., 21 (1984), pp. 67-96.
9. F. ESCALANTE, L. MONTEJANO, AND T. ROJANO, Characterization of n-path graphs and of graphs having nth root, J. Combin. Theory Ser. B, 16 (1974), pp. 282-289.
10. H. FLEISCHNER, The square of every two-connected graph is Hamiltonian, J. Combin. Theory Ser. B, 16 (1974), pp. 29-34.
11. C. FLOTOW, Graphs whose powers are chordal and graphs whose powers are interval graphs, J. Graph Theory, 24 (1997), pp. 323-330.
12. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, Oxford, UK, 1979.
13. D. P. GELLER, The square root of a digraph, J. Combin. Theory Ser. B, 5 (1968), pp. 320-321.
14. P. C. GILMORE AND A. J. HOFFMAN, A characterization of comparability graphs and of interval graphs, Canad. J. Math., 16 (1964), pp. 539-548.
15. F. HARARY, R. M. KARP, AND W. T. TUTTE, A criterion for planarity of the square of a graph, J. Combin. Theory, 2 (1967), pp. 395-405.
16. F. HARARY AND T. A. MCKEE, The square of a chordal graph, Discrete Math., 128 (1994), pp. 165-172.
17. P. HELL, R. SHAMIR, AND R. SHARAN, A fully dynamic algorithm for recognizing and representing proper interval graphs, SIAM J. Comput., 31 (2001), pp. 289-305.
18. P. KEARNEY AND D. CORNEIL, Tree powers, J. Algorithms, 29 (1998), pp. 111-131.
19. L. T. KOU, L. J. STOCKMEYER, AND C. K. WONG, Covering edges by cliques with regard to keyword conflicts and intersection graphs, Comm. ACM, 21 (1978), pp. 135-138.
20. R. LASKAR AND D. SHIER, On powers and centers of chordal graphs, Discrete Appl. Math., 6 (1983), pp. 139-147.
21. H. T. LAU, Finding a Hamiltonian Cycle in the Square of a Block, Ph.D. thesis, School of Computer Science, McGill University, Montreal, QC, Canada, 1980.
22. L. C. LAU, Bipartite roots of graphs, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2004, pp. 945-954.
23. L. C. LAU, Roots of Graphs, Master's thesis, University of Toronto, Toronto, ON, Canada, 2003.
24. G.-H. LIN, P. E. KEARNEY, AND T. JIANG, Phylogenetic k-root and Steiner k-root, in Proceedings of the 11th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 1969, Springer-Verlag, Berlin, 2000, pp. 539-551.
25. Y.-L. LIN AND S. S. SKIENA, Algorithms for square roots of graphs, SIAM J. Discrete Math., 8 (1995), pp. 99-118.
26. N. LINIAL, Locality in distributed graph algorithms, SIAM J. Comput., 21 (1992), pp. 193-201.
27. A. LUBIW, γ-free Matrices, Master's thesis, University of Waterloo, Waterloo, ON, Canada, 1982.
28. M. MOLLOY AND M. R. SALAVATIPOUR, Frequency channel assignment on planar networks, in Proceedings of the 10th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2461, Springer-Verlag, Berlin, 2002, pp. 736-747.
29. R. MOTWANI AND M. SUDAN, Computing roots of graphs is hard, Discrete Appl. Math., 54 (1994), pp. 81-88.
30. A. MUKHOPADHYAY, The square root of a graph, J. Combin. Theory, 2 (1967), pp. 290-295.
31. N. NISHIMURA, P. RAGDE, AND D. THILIKOS, On graph powers for leaf-labeled trees, J. Algorithms, 42 (2002), pp. 69-108.
32. S. RAMACHANDRAN, Planar graphs with square or cube root are four colorable, J. Combin. Theory Ser. B, 24 (1978), pp. 362-364.
33. A. RAYCHAUDHURI, On powers of interval and unit interval graphs, Congr. Numer., 59 (1987), pp. 235-242.
34. A. RAYCHAUDHURI, On powers of strongly chordal and circular arc graphs, Ars Combin., 34 (1992), pp. 147-160.
35. I. C. Ross AND F. HARARY, The square of a tree, Bell System Tech. J., 39 (1960), pp. 641-647.
36. M. SEKANINA, On an ordering of the vertices of a graph, Časopis Pěst. Mat., 88 (1963), pp. 265-282.
37. J. P. SPINRAD, Doubly lexical ordering of dense 0-1 matrices, Inform. Process. Lett., 45 (1993), pp. 229-235.
38. D. WEST, Introduction to Graph Theory, 2nd ed., Prentice-Hall, Englewood Cliffs, NJ, 2001.