Forestal algebras and algebraic forests (on a new class of weakly compact graphs)

Discrete Mathematics

Volumn 225, Issue 1-3, 2000, Pages 149-172

  Evdokimov, Sergei ^a   Ponomarenko, Ilia ^b   Tinhofer, Gottfried ^c  

^a ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345754788     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00152-7     Document Type: Article

References (25)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. L. Babai, Automorphism groups, isomorphism, reconstruction, in: R.L. Graham, M. Grotschel, L. Lovasz (Eds.), Handbook of Combinatorics, Vol. 2, Elsevier Science, Amsterdam, 1995, pp. 1447-1541.
3. L. Babel, Computing coherent algebras (1995), submitted to Combinatorica.
4. L. Babel, I. Ponomarenko, G. Tinhofer, The isomorphism problem for directed path graphs and for rooted directed path graphs, J. Algorithms 21 (1996) 542-564.
5. K. Booth, G. Lueker, A linear time algorithm for deciding interval graph isomorphism, J. ACM 26 (1979) 183-195.
6. R.A. Brualdi, Some applications of doubly stochastic matrices, Linear Algebra Appl. 107 (1988) 77-100.
7. A. Chan, C.D. Godsil, Symmetry and Eigenvectors, NATO ASI Ser., Ser. C., Math. Phys. Sci. 497 (1997) 75-106.
8. D.G. Corneil, H. Lerch, L. Stewart, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
9. S.A. Evdokimov, M. Karpinski, I.N. Ponomarenko, On a new high dimensional Weisfeiler-Leman algorithm, J. Algebraic Combin. 10 (1999) 29-45.
10. S.A. Evdokimov, M. Karpinski, I.N. Ponomarenko, Compact cellular algebras and permutation groups, Discrete Math. 197/198 (1999) 247-267.
11. S.A. Evdokimov, I.N. Ponomarenko, On primitive cellular algebras, Zap. Nauchn. Sem. POMI 256 (1999) 38-68.
12. S.A. Evdokimov, I.N. Ponomarenko, On highly closed cellular algebras and highly closed isomorphisms, Electron. J. Combin. 6 (1999) R18.
13. S.A. Evdokimov, I.N. Ponomarenko, G. Tinhofer, On a new class of weakly compact graphs, Technical Report, Teçhnishe Universität München, November, 1997.
14. I.A. Faradžev, M.H. Klin, M.E. Muzichuk, Cellular rings and groups of automorphisms of graphs, in: I.A. Faradžev et al. (Eds.), Investigations in Algebraic Theory of Combinatorial Objects, Kluwer Acad. Publ, Dordrecht, 1994, pp. 1-152.
15. V.Z. Feinberg, Automorphism groups of trees, DAN BSSR 13 (1969) 1065-1067.
16. C.D. Godsil, Compact graphs and equitable partitions, Linear Algebra Appl. 255 (1997) 259-266.
17. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
18. D.G. Higman, Coherent configurations 1, Rend. Mat. Sem. Padova 44 (1970) 1-25.
19. D.G. Higman, Coherent algebras, Linear Algebra Appl. 93 (1987) 209-239.
20. H. Schreck, G. Tinhofer, A note on certain subpolytopes of the assignment polytope associated with circulant graphs, Linear Algebra Appl. 111 (1988) 125-134.
21. G. Tinhofer, Graph isomorphism and theorems of Birkhoff type, Computing 36 (1986) 285-300.
22. G. Tinhofer, Strong tree-cographs are Birkhoff graphs, Discrete Appl. Math. 22 (1988/89) 275-288.
23. G. Tinhofer, A note on compact graphs, Discrete Appl. Math. 30 (1991) 253-264.
24. B. Weisfeiler (Ed.), On the Construction and Identification of Graphs, Lecture Notes in Mathematics, Vol. 558, Springer, Berlin, 1976.
25. B.Ju. Weisfeiler, A.A. Leman, Reduction of a graph to a canonical form and an algebra which appears in the process, NTI, Ser. 2 9 (1968) 12-16.