|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
1. Biggs, N., Algebraic Graph Theory, Cambridge University Press, 1974.
|
| |
2
|
2. Cameron, P.J., "Automorphism Groups of Graphs," in Selected Topics in Graph Theory, ed. Beineke Wilson, Academic Press, 1983.
|
 |
3
|
|
| |
4
|
4. Capobianco, M. and J.C. Molluzzo, Examples and Counterexamples in Graph Theory, North-Holland, 1978.
|
| |
5
|
5. Cayley, A., "The Theory of Groups Graphical Representation," Mathematical Papers, vol. 10, pp. 26- 28, Cambridge, 1895.
|
| |
6
|
6. Coxeter, H.S.M., "Self-Dual Configurations and Regular Graphs," Bull. Amer. Math. Soc., vol. 56, pp. 413-455, 1950.
|
| |
7
|
7. Coxeter, H.S.M. and W.O.J. Moser, Generators and Relations for Discrete Groups, Springer-Verlag, 1980.
|
| |
8
|
8. Coxeter, H.S.M., R. Frucht, and D.L. Powers, Zero Symmetric Graphs, Academic Press, 1981.
|
| |
9
|
9. Erdos, P. and A. Renyi, "Asymmetric Graphs," Acta. Math. Acad. Sci. Hungar., vol. 14, pp. 295-315, 1963.
|
| |
10
|
10. Foster, R.M., "Geometrical Circuits of Electrical Networks," Trans. Amer. Inst. Elec. Engrs., vol. 51, pp. 309- 317, 1932.
|
| |
11
|
|
| |
12
|
12. Frucht, R., "on the Groups of Repeated Graphs," Bull. Amer. Math. Soc., vol. 55, pp. 418-420, 1949.
|
| |
13
|
13. Frucht, R., "Graphs of Degree Three with a given Abstract Group," Canad. J. Math., vol. 1, pp. 365-378, 1949.
|
| |
14
|
14. Frucht, R., "How to Describe a Graph," Ann. N. Y. A. S., vol. 175, pp. 159-167, 1970.
|
| |
15
|
15. Furst, M., J. Hopcroft, and E. Luks, "Polynomial Time Algorithm for Permutation Groups," 21st FOCS, pp. 36-41, 1980.
|
| |
16
|
16. Garey, M. and D. Johnson, Computers and Intractability, W.H. Freeman, 1979.
|
| |
17
|
17. Graver, J.E. and M.E. Watkins, Combinatorics with Emphasis on the Theory of Graphs, GTM Springer-Verlag, 1977.
|
| |
18
|
18. Grossman, I. and W. Magnus, Groups and Their Graphs, Random House, 1964.
|
| |
19
|
19. Harary, F. and W.T. Tutte, "On the Order of the Group of a Planar Map," J. Comb. Theory, vol. 1, pp. 394-395, 1966.
|
| |
20
|
20. Harary, F., Graph Theory, Addison-Wesley, 1972.
|
| |
21
|
21. Hausner, M., A Vector Space Approach to Geometry, Prentice-Hall, 1965.
|
| |
22
|
22. Jerrum, M., "A Compact Representation for Permutation Groups," 23rd FOCS, pp. 126-133, 1982.
|
| |
23
|
23. Kagno, I.N, "Corrections," Amer. J. Math., vol. 69, p. 872, 1947.
|
| |
24
|
24. Kagno, I.N., "Linear Graphs of Degree < = 6 and Their Groups," Amer. J. Math., vol. 68, pp. 505-520, 1946.
|
| |
25
|
25. Kagno, I.N., "Desargue's and Pappus' graphs and their Groups," Amer. J. Math., vol. 69, pp. 859-862, 1947.
|
| |
26
|
|
| |
27
|
27. Lovasz, L., Combinatorial Problems and Exercises, North-Holland, 1979.
|
| |
28
|
28. McKay, B.D., "Computing Automorphisms and Canonical Labelings of Graphs," Lecture Notes in Mathematics, vol. 686, pp. 223- 232, Springer-Verlag, 1977.
|
| |
29
|
29. Miller, W., Symmetry Groups and Their Application, Academic Press, 1972.
|
| |
30
|
30. Polya, G., "Kombinatorische Anzhalbestimmugen fur Guppen, Graphen, und Chemische Verbindungen," Acta Math., vol. 68, pp. 145-254, 1937.
|
| |
31
|
31. Reingold, E.M. and J.S. Tilford, "Tidier Drawing of Trees," IEEE Trans. Software Eng., vol. 7, pp. 223-228, 1981.
|
| |
32
|
32. Sabidussi, G., "Graphs with a Given Group and Given Graph Theoretical Properties," Canad. J. Math., vol. 9, pp. 515-525, 1957.
|
| |
33
|
33. Sabidussi, G., "The Composition of Graphs," Duke Math J., vol. 26, pp. 693-696, 1959.
|
| |
34
|
34. Sabidussi, G., "On the Minimum Order of Graphs with a Given Automorphism Group," Monatsh. Math., vol. 63, pp. 124-127, 1959.
|
| |
35
|
35. Sabidussi, G., "Graph Multiplication," Math. Z., vol. 72, pp. 446-457, 1960.
|
| |
36
|
36. Sims, C., "Computational Methods in the Study of Permutation Groups," in Computational Problems in Abstract Algebra, ed. J. Leech, Pergamon Press, 1970.
|
| |
37
|
37. Supowit, K.J. and E.M. Reingold, "The Complexity of Drawing Trees Nicely," Acta Informatica, vol. 18, pp. 377-392, Jan. 1983.
|
| |
38
|
38. Trickey, H. Private communication.
|
| |
39
|
39. Tutte, W.T., "On the Symmetry of Cubic Graphs," Canad. J. Math., vol. 11, pp. 621-624, 1959.
|
| |
40
|
40. Tutte, W.T., "Convex Representations of Graphs," Proc. London Math. Soc., vol. 10, pp. 304- 320, 1960.
|
| |
41
|
41. Tutte, W.T., "How to Draw a Graph," Proc. London Math. Soc., vol. 52, pp. 743-767, 1963.
|
| |
42
|
42. Tutte W.T., Connectivity in Graphs, University of Toronto Press, 1966.
|
| |
43
|
43. Tutte, W.T., "What is a Map?," in New Directions in the Theory of Graphs, Academic Press, 1973.
|
| |
44
|
44. Tutte, W.T., Graph Theory, Addison Wesley, 1984.
|
| |
45
|
|
| |
46
|
46. Watkins, M.E., "Graphical Regular Representations of Alt., Symm., and Misc. Small Groups," Aequationes Math., vol. 11, pp. 40-50.
|
| |
47
|
47. Watkins, M.E., "On the Action of Non-abelian Groups on Graphs," J. Combin. Theory Ser. B, vol. 1, pp. 95-104, 1971.
|
| |
48
|
48. Weinberg, L., "On the Maximum Order of the Automorphism Group of a Planar Triply Connected Graph," SIAM J., vol. 14, pp. 729-738, 1966.
|
| |
49
|
49. Wetherell, C. and A. Shannon, "Tidy Drawings of Trees," IEEE Trans. Software Eng., vol. 5, pp. 514-520, 1979.
|
| |
50
|
50. Weyl, H., Symmetry, Princeton, 1951.
|
| |
51
|
51. Wielandt, Finite Permutation Groups, Academic Press, 1964.
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.2