Bipartite Roots of Graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 945-954

  Lau, Lap Chi ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; ISOMORPHISM; PHYLOGENY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HAMILTONIANS; MATHEMATICAL TECHNIQUES; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

GRAPH THEORY;

EID: 1842591323     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. R. Balakrishnan, P. Paulraja, Powers of chordal graphs, Australian Journal of Mathematics Series A, 35, pp. 211-217, 1983.
2. V.N. Bhat-Nayak, Powers and roots of graphs: a survey, Optimization, design of experiments and graph theory (Bombay, 1986), Indian Inst. Tech., Bombay, 246-282, 1988.
3. P. Damaschke, Distances in cocomparability graphs and their powers, Discrete Applied Mathematics, 35, pp. 67-72, 1992.
4. F. Escalante, L. Montejano, T. Rojano, Characterization of n-path graphs and of graphs having nth root, J. Combin. Theory B, 16, pp. 282-289, 1974.
5. H. Fleischner, The square of every two-connected graph is Hamiltonian, J. Combin. Theory B, 16, pp. 29-34, 1974.
6. M.R. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-completeness, Freeman, Oxford, 1979.
7. D.P. Geller, The square root of a digraph, J. Combin. Theory B, 5, pp. 320-321, 1968.
8. F. Harary, R.M. Karp, W.T. Tutte, A criterion for planarity of the square of a graph, J. Combin. Theory, 2, pp. 395-405, 1967.
9. P. Kearney, D. Corneil, Tree powers, Journal of Algorithms, 29, pp. 111-131, 1998.
10. L.C. Lau, Bipartite roots of graphs, http://www.ca.toronto.edu/~chi/sb. ps.
11. Guo-Hui Lin, Paul E. Kearney, Tao Jiang, Phylogenetic k-Root and Steiner k-Root, Lecture Notes in Computer Science, 1969, pp. 539-551, 2000.
12. Y.L. Lin, S. Skiena, Algorithms for square roots of graphs, SIAM J. Disc. Math., Vol. 8, No. 1, pp. 99-118, 1995.
13. N. Linial, Locality in distributed graph algorithms, SIAM J. Comput., 21, pp. 193-201, 1992.
14. M. Molloy and M.R. Salavatipour, Frequency Channel Assignment on Planar Networks, Proceedings of 10th Annual European Symposium on Algorithms (ESA 2002), LNCS 2461, pp. 736-747
15. R. Motwani, M. Sudan, Computing roots of graphs is hard, Discrete Applied Mathematics, 54, pp. 81-88, 1994.
16. A. Mukhopadhyay, The square root of a graph, J. Combin. Theory, 2, pp. 290-295, 1967.
17. N. Nishimura, P. Ragde, D. Thilikos, On graph powers for leaf-labeled trees, Journal of Algorithms, 42, pp. 69-108, 2002.
18. A. Raychaudhuri, On powers of interval and unit interval graphs, Congr. Numer., 59, pp. 235-242, 1987.
19. A. Raychaudhuri, On powers of strongly chordal and circular arc graphs, Ars Combin., 34, pp. 147-160, 1992.
20. I.C. Ross, F. Harary, The square of a tree, Bell System Tech. J., 39, pp. 641-647, 1960.
21. M. Sekanina, On an ordering of the vertices of a graph, Časopis Pěst. Math., 88, pp. 265-282, 1963.
22. D. West, Introduction to graph theory, Prentice Hall, Ed. 2, 2001.