Fast generation of regular graphs and construction of cages

Journal of Graph Theory

Volumn 30, Issue 2, 1999, Pages 137-146

  Meringer, Markus ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

Cage; Isomorphism problem; Orderly generation; Regular graph

Indexed keywords

EID: 0033476792     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G     Document Type: Article

References (17)

1. G. Brinkmann, Fast generation of cubic graphs. J Graph Theory 23 (1996), 139-149.
2. G. Brinkmann and M. Meringer, The smallest 4-regular 4-chromatic graphs with girth 5. Graph Theory Notes NY XXXII (1997), 40-41.
3. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-regular graphs, Springer-Verlag, Berlin, 1989.
4. C. Colbourn and J. Dinitz, CRC handbook of combinatorial designs, CRC Press, Boca Raton, 1996.
5. Roland Grund, Konstruktion schlichter Graphen mit gegebener Gradpartition. Bayreuther Math Schriften 44 (1993), 73-104.
6. Roland Grund, Konstruktion molekularer Graphen mit gegebenen Hybridisierungen und überlappungsfreien Fragmenten. Bayreuther Math Schriften 49 (1995), 1-113.
7. Thomas Grüner, Ein neuer Ansatz zur rekursiven Erzeugung von schlichten Graphen. Master's thesis, Universität Bayreuth, 1995.
8. T. Grüner, R. Laue, and M. Meringer, Algorithms for group actions: Homomorphism principle and orderly generation applied to graphs. DIMACS Series in Discrete Math Theoretical Comp Sci (1997), 113-122.
9. R. Hager, A. Kerber, R. Laue, D. Moser, and W. Weber, Construction of orbit representatives. Bayreuther Math Schriften 35 (1991), 157-169.
10. Adalbert Kerber, Algebraic combinatorics via finite group actions, Wissenschaftsverlag, Mannheim, (1991).
11. Reinhard Laue, Construction of combinatorial objects - A tutorial, Bayreuther Math Schriften 43 (1993), 53-96.
12. Markus Meringer, Erzeugung regulärer Graphen. Master's thesis Universität Bayreuth (1996).
13. R. C. Read: Everyone a winner. Ann discr math 2 (1978), 107-120.
14. C. C. Sims, Computation with permutation groups. Proc. of the Second Symposium on Symbolic and Algebraic Manipulation S. R. Petrick (Editor) New York, 1971.
15. P.-K. Wong, Cages - A Survey. J Graph Theory 6 (1982), 1-22.
16. Y. S. Yang and C. X. Zhang, A new (5, 5) cage and the number of (5, 5) cages. (Chinese) J Math Res Expo 9 (1989), 628-632.
17. A. Zitnik, Anti-directed walks in 4-valent graphs, Preprint, University of Ljubljana, 1996.