Combinatorics

Graph Theory

05Cxx

  1. David Abelson, Seok-Hee Hong, and D. E. Taylor, Geometric automorphism groups of graphs, Discrete Appl. Math. 155 (2007), no. 17, 2211–2226.[MR]
  2. David Abelson, Seok-Hee Hong, and Donald E. Taylor, A group-theoretic method for drawing graphs symmetrically, Graph Drawing, Lecture Notes in Comput. Sci., vol. 2528, Springer, Berlin, 2002, pp. 86–97.[MR]
  3. R. D. Baker, G. L. Ebert, J. Hemmeter, and A. Woldar, Maximal cliques in the Paley graph of square order, J. Statist. Plann. Inference 56 (1996), no. 1, 33–38.[MR/doi]
  4. John Bamberg, Geoffrey Pearce, and Cheryl E. Praeger, Transitive decompositions of graph products: Rank 3 grid type, J. Group Theory 11 (2008), no. 2, 185–228.[MR]
  5. Eiichi Bannai, Osamu Shimabukuro, and Hajime Tanaka, Finite analogues of non-Euclidean spaces and Ramanujan graphs, European J. Combin. 25 (2004), no. 2, 243–259.[MR]
  6. Eiichi Bannai, Osamu Shimabukuro, and Hajime Tanaka, Finite Euclidean graphs and Ramanujan graphs, Discrete Math. 309 (2009), no. 20, 6126–6134.[MR/doi]
  7. Wayne Barrett, Jason Grout, and Raphael Loewy, The minimum rank problem over the finite field of order 2: minimum rank 3, Linear Algebra and its Applications 430 (2009), no. 4, 890–923.[doi]
  8. C. Bates, D. Bundy, Sarah B. Perkins, and P. Rowley, Commuting involution graphs for symmetric groups, J. Algebra 266 (2003), no. 1, 133–153.[MR]
  9. N. L. Biggs, Presentations for cubic graphs, Computational Group Theory (Durham, 1982), Academic Press, London, 1984, pp. 57–63.[MR]
  10. Norman Biggs, Constructions for cubic graphs with large girth, Electron. J. Combin. 5 (1998), Article 1, 25 pp. (electronic).[MR]
  11. John van Bon and Arjeh M. Cohen, Linear groups and distance-transitive graphs, European J. Combin. 10 (1989), no. 5, 399–411.[MR]
  12. John van Bon, Arjeh M. Cohen, and Hans Cuypers, Graphs related to Held's simple group, J. Algebra 123 (1989), no. 1, 6–26.[MR]
  13. Mireille Boutin and Gregor Kemper, Lossless representation of graphs using distributions, preprint (2007), 19 pages.[arXiv]
  14. John M. Boyer and Wendy J. Myrvold, On the cutting edge: Simplified O(n) planarity by edge addition, J. Graph Algorithms Appl. 8 (2004), no. 3, 241–273 (electronic).[MR]
  15. John Bray, Christopher Parker, and Peter Rowley, Cayley type graphs and cubic graphs of large girth, Discrete Math. 214 (2000), no. 1-3, 113–121.[MR]
  16. Andries E. Brouwer, Naoyuki Horiguchi, Masaaki Kitazume, and Hiroyuki Nakasora, A construction of the sporadic Suzuki graph from U3(4), J. Combin. Theory Ser. A 116 (2009), no. 5, 1056–1062.[MR]
  17. Pierre Cartier, Combinatorics of trees, Surveys in modern mathematics, London Math. Soc. Lecture Note Ser., vol. 321, Cambridge Univ. Press, Cambridge, 2005, pp. 274–282.[MR]
  18. Marston Conder, A note on Cayley graphs, J. Combin. Theory Ser. B 40 (1986), no. 3, 362–368.[MR]
  19. Marston Conder, A new 5-arc-transitive cubic graph, J. Graph Theory 11 (1987), no. 3, 303–307.[MR]
  20. Marston Conder, Groups of minimal genus including C2 extensions of PSL(2,q) for certain q, Quart. J. Math. Oxford Ser. (2) 38 (1987), no. 152, 449–460.[MR]
  21. Marston Conder, Maximal automorphism groups of symmetric Riemann surfaces with small genus, J. Algebra 114 (1988), no. 1, 16–28.[MR]
  22. Marston Conder, An infinite family of 4-arc-transitive cubic graphs each with girth 12, Bull. London Math. Soc. 21 (1989), no. 4, 375–380.[MR]
  23. Marston Conder, Constructing symmetric graphs, Theta 3 (1989), 11–16.
  24. Marston Conder, Experimental algebra, Math. Chronicle 20 (1991), 1–11.[MR]
  25. Marston Conder, Group actions on the cubic tree, J. Algebraic Combin. 1 (1992), no. 3, 209–218.[MR]
  26. Marston Conder, Regular maps with small parameters, J. Austral. Math. Soc. Ser. A 57 (1994), no. 1, 103–112.[MR]
  27. Marston Conder, Group actions on graphs, maps and surfaces with maximum symmetry, Groups St. Andrews 2001 in Oxford. Vol. I, London Math. Soc. Lecture Note Ser., vol. 304, Cambridge Univ. Press, Cambridge, 2003, pp. 63–91.[MR]
  28. Marston Conder, Genus spectra for symmetric embeddings of graphs on surfaces, Electronic Notes in Discrete Mathematics 31 (2008), 27–31.[doi]
  29. Marston Conder, On symmetries of Cayley graphs and the graphs underlying regular maps, J. Algebra 321 (2009), no. 11, 3112–3127.[MR]
  30. Marston Conder and Peter Dobcsányi, Determination of all regular maps of small genus, J. Combin. Theory Ser. B 81 (2001), no. 2, 224–242.[MR]
  31. Marston Conder and Peter Dobcsányi, Trivalent symmetric graphs on up to 768 vertices, J. Combin. Math. Combin. Comput. 40 (2002), 41–63.[MR]
  32. Marston Conder and Brent Everitt, Regular maps on non-orientable surfaces, Geom. Dedicata 56 (1995), no. 2, 209–219.[MR]
  33. Marston Conder, Robert Jajcay, and Thomas Tucker, Regular Cayley maps for finite abelian groups, J. Algebraic Combin. 25 (2007), no. 3, 259–283.[MR]
  34. Marston Conder and Cai Heng Li, On isomorphisms of finite Cayley graphs, European J. Combin. 19 (1998), no. 8, 911–919.[MR]
  35. Marston Conder and Peter Lorimer, Automorphism groups of symmetric graphs of valency 3, J. Combin. Theory Ser. B 47 (1989), no. 1, 60–72.[MR]
  36. Marston Conder, Peter Lorimer, and Cheryl Praeger, Constructions for arc-transitive digraphs, J. Austral. Math. Soc. Ser. A 59 (1995), no. 1, 61–80.[MR]
  37. Marston Conder, Aleksander Malnič, Dragan Marušič, Tomaž Pisanski, and Primož Potočnik, The edge-transitive but not vertex-transitive cubic graph on 112 vertices, J. Graph Theory 50 (2005), no. 1, 25–42.[MR]
  38. Marston Conder, Aleksander Malnič, Dragan Marušič, and Primož Potočnik, A census of semisymmetric cubic graphs on up to 768 vertices, J. Algebraic Combin. 23 (2006), no. 3, 255–294.[MR]
  39. Marston Conder and Dragan Marušič, A tetravalent half-arc-transitive graph with non-abelian vertex stabilizer, J. Combin. Theory Ser. B 88 (2003), no. 1, 67–76.[MR]
  40. Marston Conder, Margaret Morton, and Cheryl E. Praeger, Partition graphs for finite symmetric groups, J. Graph Theory 25 (1997), no. 2, 107–117.[MR]
  41. Marston Conder, Margaret Morton, and Cheryl E. Praeger, Two-arc closed subsets of graphs, J. Graph Theory 42 (2003), no. 4, 350–364.[MR]
  42. Marston Conder and Roman Nedela, Symmetric cubic graphs of small girth, J. Combin. Theory Ser. B 97 (2007), no. 5, 757–768.[MR]
  43. Marston Conder and Roman Nedela, A refined classification of symmetric cubic graphs, J. Algebra 322 (2009), no. 3, 722–740.[MR/doi]
  44. Marston Conder and Roman Nedela, A refined classification of symmetric cubic graphs, J. Algebra 322 (2009), no. 1, 722–740.
  45. Marston Conder, Primož Potočnik, and Jozef Širáň, Regular hypermaps over projective linear groups, J. Aust. Math. Soc. 85 (2008), 155–175 pages.
  46. Marston Conder, Jozef Sirán, and Tom Tucker, The genera, reflexibility and simplicity of regular maps, J. Eur. Math. Soc. (JEMS), to appear, 23 pages.
  47. Marston Conder and Cameron G. Walker, The infinitude of 7-arc-transitive graphs, J. Algebra 208 (1998), no. 2, 619–629.[MR]
  48. Marston Conder and Steve Wilson, Inner reflectors and non-orientable regular maps, Discrete Math. 307 (2007), no. 3-5, 367–372.[MR]
  49. Maria Cristeta Cuaresma, Michael Giudici, and Cheryl E. Praeger, Homogeneous factorisations of Johnson graphs, Des. Codes Cryptogr. 46 (2008), no. 3, 303–327.[MR]
  50. Italo J. Dejter, C-homogeneous graphs via ordered pencils, preprint (2007), 18 pages.[arXiv]
  51. Italo J. Dejter, On Clique Turan graph-homogeneity, preprint (2007), 20 pages.[arXiv]
  52. Italo J. Dejter, On a {K4,K2,2,2}-ultrahomogeneous graph., Australas. J. Comb. 44 (2009), 63–75.
  53. Italo J. Dejter, A construction based on the Biggs-Smith graph, preprint (2010), 8 pages.[arXiv]
  54. A. Delgado and R. Weiss, On certain coverings of generalized polygons, Bull. London Math. Soc. 21 (1989), no. 3, 235–242.[MR]
  55. Alice Devillers and Michael Giudici, Involution graphs where the product of two adjacent vertices has order three, J. Aust. Math. Soc. 85 (2008), no. 3, 305–322.
  56. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, A remarkable Mathieu graph tower, preprint, 23 pages.
  57. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Primitive decompositions of Johnson graphs, J. Combin. Theory Ser. A 115 (2008), no. 6, 925–966.[MR]
  58. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, An infinite family of biquasiprimitive 2-arc transitive cubic graphs, Preprint (2009), 1–19.
  59. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Locally s-distance transitive graphs, preprint (2010).[arXiv]
  60. Alice Devillers, Michael Giudici, Cai Heng Li, and Cheryl E. Praeger, Some graphs related to the small Mathieu groups, European J. Combin. 31 (2010), no. 1, 336–348.[MR/doi]
  61. Michael J. Dinneen and Paul R. Hafner, New results for the degree/diameter problem, Networks 24 (1994), no. 7, 359–367.[MR]
  62. Edward Dobson and Dragan Marušič, An unusual decomposition of a complete 7-partite graph of order 28, Discrete Math. 308 (2008), no. 20, 4595–4598.[MR]
  63. Xin Gui Fang, George Havas, and Cheryl E. Praeger, On the automorphism groups of quasiprimitive almost simple graphs, J. Algebra 222 (1999), no. 1, 271–283.[MR]
  64. Xin Gui Fang, George Havas, and Jie Wang, Automorphism groups of certain non-quasiprimitive almost simple graphs, Groups St. Andrews 1997 in Bath, I, London Math. Soc. Lecture Note Ser., vol. 260, Cambridge Univ. Press, Cambridge, 1999, pp. 267–274.[MR]
  65. Yan-Quan Feng, Klavdija Kutnar, Aleksander Malnič, and Dragan Marušič, On 2-fold covers of graphs, J. Combin. Theory Ser. B 98 (2008), no. 2, 324–341.[MR/arXiv]
  66. Yan-Quan Feng, Jin Ho Kwak, and Chuixiang Zhou, Constructing even radius tightly attached half-arc-transitive graphs of valency four, J. Algebraic Combin. 26 (2007), no. 4, 431–451.[MR]
  67. Louis Ferré and Bertrand Jouve, Vertex partitioning of a class of digraphs, Math. Sci. Hum. (2002), no. 158, 59–77.[MR]
  68. Carla Fiori and Beatrice Ruini, Infinite classes of dihedral snarks, Mediterr. J. Math. 5 (2008), no. 2, 199–210.[MR]
  69. W. Fish, J. D. Key, and E. Mwambene, Graphs, designs and codes related to the n-cube, Discrete Math. 309 (2009), no. 10, 3255–3269.[MR]
  70. Michael Giudici, Cai Heng Li, Primož Potočnik, and Cheryl E. Praeger, Homogeneous factorisations of complete multipartite graphs, Discrete Math. 307 (2007), no. 3-5, 415–431.[MR]
  71. Michael Giudici and Aedan Pope, The diameters of commuting graphs of linear groups and matrix rings over the integers modulo m, preprint (2010), 10 pages.[arXiv]
  72. H. H. Glover, K. Kutnar, and Dragan Marušič, Hamiltonian cycles in cubic Cayley graphs: The <2, 4k, 3> case, J. Algebraic Combin., to appear (2009).
  73. Jason Grout, Ultraconnected and critical graphs, Master's Thesis, Brigham Young University, 2003.
  74. Paul R. Hafner, Large Cayley graphs and digraphs with small degree and diameter, Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 291–302.[MR]
  75. Paul R. Hafner, Geometric realisation of the graphs of McKay-Miller-Širáň, J. Combin. Theory Ser. B 90 (2004), no. 2, 223–232.[MR]
  76. Paul R. Hafner, On the graphs of Hoffman-Singleton and Higman-Sims, Electron. J. Combin. 11 (2004), no. 1, Research Paper 77, 33 pp. (electronic).[MR]
  77. Stephen P. Humphries, Quotients of Coxeter complexes, fundamental groupoids and regular graphs, Math. Z. 217 (1994), no. 2, 247–273.[MR]
  78. A. A. Ivanov and Cheryl E. Praeger, On finite affine 2-arc transitive graphs, European J. Combin. 14 (1993), no. 5, 421–444.[MR]
  79. Robert E. Jamison and Gretchen L. Matthews, Distance k colorings of Hamming graphs, in Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 183, 2006, pp. 193–202.[MR]
  80. Peter Keevash and Benny Sudakov, Packing triangles in a graph and its complement, J. Graph Theory 47 (2004), no. 3, 203–216.[MR]
  81. István Kovács, Klavdija Kutnar, and János Ruff, Rose window graphs underlying rotary maps, Discrete Math. 310 (2010), no. 12, 1802–1811.[MR/doi]
  82. István Kovács, Aleksander Malnič, Dragan Marušič, and Štefko Miklavič, One-matching bi-Cayley graphs over abelian groups, European J. Combin. 30 (2009), no. 2, 602–616.[MR]
  83. K. Kutnar, Aleksander Malnič, Dragan Marušič, and Štefko Miklavič, The strongly distance-balanced property of the generalized Petersen graphs, Ars Math. Contemp. 2 (2009), no. 1, 41–47.
  84. Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, and Štefko Miklavič, Distance-balanced graphs: Symmetry conditions, Discrete Math. 306 (2006), no. 16, 1881–1894.[MR]
  85. Klavdija Kutnar and Dragan Marušič, Hamiltonicity of vertex-transitive graphs of order 4p, European J. Combin. 29 (2008), no. 2, 423–438.[MR/arXiv]
  86. Klavdija Kutnar and Dragan Marušič, A complete classification of cubic symmetric graphs of girth 6, J. Combin. Theory Ser. B 99 (2009), no. 1, 162–184.[MR]
  87. Klavdija Kutnar and Primož Šparl, Hamilton paths and cycles in vertex-transitive graphs of order 6p, Discrete Math. 309 (2009), no. 17, 5444–5460.[MR/doi]
  88. Felix Lazebnik and Raymond Viglione, An infinite series of regular edge- but not vertex-transitive graphs, J. Graph Theory 41 (2002), no. 4, 249–258.[MR]
  89. Cai Heng Li, Tian Khoon Lim, and Cheryl E. Praeger, Homogeneous factorisations of complete graphs with edge-transitive factors, J. Algebraic Combin. 29 (2009), no. 1, 107–132.[MR]
  90. Paulette Lieby, Colouring planar graphs, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 315–330.[MR]
  91. Tian Khoon Lim, Edge-transitive homogeneous factorisations of complete graphs, preprint (2004), 130 pages.[arXiv]
  92. Tian Khoon Lim, Arc-transitive homogeneous factorizations and affine planes, J. Combin. Des. 14 (2006), no. 4, 290–300.[MR]
  93. Tian Khoon Lim and Cheryl E. Praeger, On generalized Paley graphs and their automorphism groups, Michigan Math. J. 58 (2009), no. 1, 293–308.[MR/arXiv]
  94. Peter Lorimer, The construction of some trivalent symmetric graphs, Ars Combin. 26 (1988), 107–114.[MR]
  95. Peter Lorimer, The construction of Tutte's 8-cage and the Conder graph, J. Graph Theory 13 (1989), no. 5, 553–557.[MR]
  96. Peter Lorimer, Embeddings of symmetric graphs in surfaces, Australas. J. Combin. 3 (1991), 31–54.[MR]
  97. Marko Lovrečič Saražin, Walter Pacco, and Andrea Previtali, Generalizing the generalized Petersen graphs, Discrete Math. 307 (2007), no. 3-5, 534–543.[MR]
  98. Aleksander Malnič, Dragan Marušič, Štefko Miklavič, and Primož Potočnik, Semisymmetric elementary abelian covers of the Möbius-Kantor graph, Discrete Math. 307 (2007), no. 17-18, 2156–2175.[MR/arXiv]
  99. Aleksander Malnič, Dragan Marušič, and Primož Potočnik, Elementary abelian covers of graphs, J. Algebraic Combin. 20 (2004), no. 1, 71–97.[MR]
  100. Aleksander Malnič, Dragan Marušič, and Primož Potočnik, On cubic graphs admitting an edge-transitive solvable group, J. Algebraic Combin. 20 (2004), no. 1, 99–113.[MR]
  101. Aleksander Malnič, Dragan Marušič, and Primož Šparl, On strongly regular bicirculants, European J. Combin. 28 (2007), no. 3, 891–900.[MR]
  102. Aleksander Malnič and Primož Potočnik, Invariant subspaces, duality, and covers of the Petersen graph, European J. Combin. 27 (2006), no. 6, 971–989.[MR]
  103. Dragan Marušič, On 2-arc-transitivity of Cayley graphs, J. Combin. Theory Ser. B 87 (2003), no. 1, 162–196.[MR]
  104. Dragan Marušič and Primož Potočnik, Bridging semisymmetric and half-arc-transitive actions on graphs, European J. Combin. 23 (2002), no. 6, 719–732.[MR]
  105. Margaret J. Morton, Corrigendum: "Classification of 4- and 5-arc-transitive cubic graphs of small girth" [J. Austral. Math. Soc. Ser. A 50 (1991), no. 1, 138–149; MR1094065 (92e:05053)], J. Austral. Math. Soc. Ser. A 52 (1992), no. 3, 419–420.[MR]
  106. Margaret Morton, A note on arc-transitive circulants, Bull. Inst. Combin. Appl. 23 (1998), 63–68.[MR]
  107. Hiroshi Nozaki, Geometrical approach to Seidel's switching for strongly regular graphs, preprint (2009), 9 pages.[arXiv]
  108. Ju-Mok Oh, A classification of cubic s-regular graphs of order 14p, Discrete Math. 309 (2009), no. 9, 2721–2726.[MR]
  109. Ju-Mok Oh, A classification of cubic s-regular graphs of order 16p, Discrete Math. 309 (2009), no. 10, 3150–3155.[MR]
  110. Ju-Mok Oh, Arc-transitive elementary abelian covers of the Pappus graph, Discrete Math. 309 (2009), no. 23-24, 6590–6611.[MR/doi]
  111. Alen Orbanić, Parallel-product decomposition of edge-transitive maps, preprint (2005), 30 pages.[arXiv]
  112. Michael E. O'Sullivan, Algebraic construction of sparse matrices with large girth, IEEE Trans. Inform. Theory 52 (2006), no. 2, 718–727.[MR/link]
  113. C. W. Parker, Semisymmetric cubic graphs of twice odd order, European J. Combin. 28 (2007), no. 2, 572–591.[MR]
  114. Christopher Parker and Peter Rowley, Ω-covers of graphs, Bull. London Math. Soc. 32 (2000), no. 6, 658–662.[MR]
  115. Christopher Parker and Peter Rowley, Subgroup-chain graphs, Graphs Combin. 19 (2003), no. 4, 537–545.[MR]
  116. Manley Perkel and Cheryl E. Praeger, Polygonal graphs: New families and an approach to their analysis, in Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1997), vol. 124, 1997, pp. 161–173.[MR]
  117. Manley Perkel, Cheryl E. Praeger, and Richard Weiss, On narrow hexagonal graphs with a 3-homogeneous suborbit, J. Algebraic Combin. 13 (2001), no. 3, 257–273.[MR]
  118. Adolfo Piperno, Search space contraction in canonical labeling of graphs (preliminary version), preprint (2008).[arXiv]
  119. Primož Potočnik, A list of 4-valent 2-arc-transitive graphs and finite faithful amalgams of index (4,2), European J. Combin. 30 (2009), no. 5, 1323–1336.[MR]
  120. Cheryl E. Praeger and Leonard H. Soicher, Low Rank Representations and Graphs for Sporadic Groups, Australian Mathematical Society Lecture Series, vol. 8, Cambridge University Press, Cambridge, 1997, pp. xii+141.[MR]
  121. Gordon F. Royle and Cheryl E. Praeger, Constructing the vertex-transitive graphs of order 24, J. Symbolic Comput. 8 (1989), no. 4, 309–326.[MR]
  122. Stephen T. Schibell and Richard M. Stafford, Processor interconnection networks from Cayley graphs, Discrete Appl. Math. 40 (1992), no. 3, 333–357.[MR]
  123. Yin Tan, Alexander Pott, and Tao Feng, Strongly regular graphs associated with ternary bent functions, Journal of Combinatorial Theory, Series A 117 (2010), no. 6, 668–682.
  124. Nicolas M. Thiéry, Algebraic invariants of graphs; A study based on computer exploration, SIGSAM Bulletin 34 (2000), no. 3, 9–20.
  125. V. A. Ustimenko and A. J. Woldar, An improvement on the Erdős bound for graphs of girth 16, Second International Conference on Algebra (Barnaul, 1991), Contemp. Math., vol. 184, Amer. Math. Soc., Providence, RI, 1995, pp. 419–425.[MR]
  126. Libero Verardi, Matrices, graphs and equivalence relations, Ann. Mat. Pura Appl. (4) 180 (2002), no. 4, 413–428.[MR]
  127. Xiuyun Wang and Yan-Quan Feng, Hexavalent half-arc-transitive graphs of order 4p, European J. Combin. 30 (2009), no. 5, 1263–1270.[MR]
  128. Yan Wang, Xin Gui Fang, and D. F. Hsu, On the edge-forwarding indices of Frobenius graphs, Acta Math. Sin. (Engl. Ser.) 22 (2006), no. 6, 1735–1744.[MR/link]
  129. Richard Weiss, Presentations for (G,s)-transitive graphs of small valency, Math. Proc. Cambridge Philos. Soc. 101 (1987), no. 1, 7–20.[MR]
  130. Doug Wiedemann and Michael Zieve, Equivalence of sparse circulants: The bipartite Adam problem, preprint (2007), 20 pages.[arXiv]
  131. Andrew J. Woldar and Vasiliy A. Ustimenko, An application of group theory to extremal graph theory, Group Theory (Granville, OH, 1992), World Sci. Publishing, River Edge, NJ, 1993, pp. 293–298.[MR]
  132. Cui Zhang, Jin-Xin Zhou, and Yan-Quan Feng, Automorphisms of cubic Cayley graphs of order 2pq, Discrete Math. 309 (2009), no. 9, 2687–2695.[MR]
  133. Jin-Xin Zhou, Tetravalent s-transitive graphs of order 4p, Discrete Math. 309 (2009), no. 20, 6081–6086.[MR/doi]
  134. Jin-Xin Zhou and Yan-Quan Feng, Tetravalent one-regular graphs of order 2pq, J. Algebraic Combin. 29 (2009), no. 4, 457–471.[MR]
  135. Jin-Xin Zhou and Yan-Quan Feng, Cubic vertex-transitive graphs of order 2pq, J. of Graph Theory 65 (2010), no. 4, 263–350.[doi]
  136. Jin-Xin Zhou and Yan-Quan Feng, Tetravalent s-transitive graphs of order twice a prime power, J. Aust. Math. Soc. 88 (2010), no. 2, 277–288.[doi]