A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
From MaRDI portal
(Redirected from Publication:986115)
Recommendations
Cites work
- scientific article; zbMATH DE number 4145948 (Why is no real title available?)
- scientific article; zbMATH DE number 4097435 (Why is no real title available?)
- Bounding the Valency of Polygonal Graphs With Odd Girth
- Generalized reflection groups. II
- Polygonal graphs
- Symmetrical path-cycle covers of a graph and polygonal graphs
Cited in
(12)- A family of near-polygonal graphs of valency 10
- A note on the girth-doubling construction for polygonal graphs
- Symmetrical path-cycle covers of a graph and polygonal graphs
- An infinite family of vertex-primitive 2-arc-transitive digraphs
- Polygonal graphs
- scientific article; zbMATH DE number 4097435 (Why is no real title available?)
- A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth
- On narrow hexagonal graphs with a 3-homogeneous suborbit
- Graphs that contain multiply transitive matchings
- An infinite family of sharply two-arc transitive digraphs
- Two-arc transitive near-polygonal graphs
- Trivalent 2-arc transitive graphs of type \(G^1_2\) are near polygonal
This page was built for publication: A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986115)