Graph homotopy and Graham homotopy

Discrete Mathematics

Volumn 241, Issue 1-3, 2001, Pages 153-170

  Chen, Beifang ^a   Yau, Shing Tung ^b   Yeh, Yeong Nan ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b HARVARD UNIVERSITY   (United States)

^c INSTITUTE OF MATHEMATICS   (Taiwan)

Author keywords

Graham reduction; Graph homotopy; Hypergraphs; Simple homotopy

Indexed keywords

EID: 0035965431     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00115-7     Document Type: Article

References (18)

1. G. Chang, Private communication, 1995.
2. M.M. Cohen, A Course in Simple-Homotopy Theory, Springer, Berlin, 1973.
3. M.H. Graham, On the universal relation, Computer System Research Report, University of Toronto, Canada, December 1979.
4. A.V. Ivashchenko, Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs, Discrete Math. 122 (1993) 219-233.
5. A.V. Ivashchenko, Contractible transformations do not change the homology groups of graphs, Discrete Math. 126 (1994) 159-170.
6. A.V. Ivashchenko, Graphs of spheres and tori, Discrete Math. 128 (1994) 247-255.
7. A.V. Ivashchenko, Some properties of contractible transformations on graphs, Discrete Math. 133 (1994) 139-145.
8. A.V. Ivashchenko, Y.-N. Yeh, Minimal graphs of a torus, a projective plane and spheres. Some properties of minimal graphs of homology classes, Discrete Math. 126 (1994) 171-178.
9. T.T. Lee, An information-theoretic analysis of relational databases - Part I: data dependencies and information metric, IEEE Trans. Software Eng. 13 (1987) 1049-1061.
10. T.T. Lee, An information-theoretic analysis of relational databases - Part 2: information structures of database schemes, IEEE Trans. Software Eng. 13 (1987) 1062-1072.
11. T.T. Lee, The Euler formula of cyclomatic numbers of hypergraphs, Southeast Asian Bull. Math. 21 (1997) 113-137.
12. D. Maier, The Theory of Relational Databases, Computer Science Press, Rockville, MD, 1983.
13. K.K. Namibar, Some analytic tools for the design of relational database systems, VLDB V, Rio de Janeiro, Brazil, ACM, IEEE Press, New York, 1979, pp. 417-428.
14. E.H. Spanier, Algebraic Topology, McGraw-Hill, New York, 1966.
15. J. Wang, T.T. Lee, An invariant for hypergraphs, Acta Math. Appl. Sinica 12 (1996) 113-120.
16. Y.-N. Yeh, The generating polynomial and Euler characteristic of intersection graphs, Discrete Math. 131 (1994) 325-333.
17. C.T. Yu, M.Z. Ozsoyoglu, An algorithm for tree-query membership of a distributed query, Proceedings of the IEEE Computer Software and Applications Conference, 1979, pp. 306-312.
18. C.T. Yu, M.Z. Ozsoyoglu, On determining tree-query membership of a distributed query, Computer Science Report 80-1, University of Alberta, Edmonton, Canada, January 1980.