Symmetrical path-cycle covers of a graph and polygonal graphs

@article{Li2007SymmetricalPC,
  title={Symmetrical path-cycle covers of a graph and polygonal graphs},
  author={Cai Heng Li and {\'A}kos Seress},
  journal={J. Comb. Theory, Ser. A},
  year={2007},
  volume={114},
  pages={35-51}
}
A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ then the graph is called polygonal. We introduce a method for constructing near-polygonal graphs with 2-arc transitive automorphism groups. As special cases, we obtain several new infinite families of polygonal graphs. © 2006 Elsevier Inc. All rights reserved. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Near-polygonal graphs

M. Perkel
Ars. Combin. 26A • 1988
View 1 Excerpt
Highly Influenced

Generalized reflection groups II

F. Zara
J. Algebra 255 • 2002
View 1 Excerpt

Polygonal graphs: New families an approach to their analysis

M. Perkel, C. E. Praeger
Congr. Numer. 124 • 1997
View 1 Excerpt

Mathematica

S. Wolfram
Addison–Wesley, Redwood City, CA • 1991
View 1 Excerpt

Constructing polygonal graphs of large girth and degree

D. Archdeacon, M. Perkel
Congr. Numer. 70 • 1990
View 1 Excerpt

The nonexistence of 8-transitive graphs

Combinatorica • 1981
View 1 Excerpt

Connectivity in Graphs

W. T. Tutte
Math. Exp., vol. 15, Univ. of Toronto Press/Oxford Univ. Press, Toronto, ON/London • 1966
View 1 Excerpt

Similar Papers

Loading similar papers…