Symmetrical path-cycle covers of a graph and polygonal graphs
From MaRDI portal
Publication:857413
Recommendations
- A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
- Polygonal graphs
- A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth
- A note on the girth-doubling construction for polygonal graphs
- scientific article; zbMATH DE number 4097435
- A family of near-polygonal graphs of valency 10
- scientific article; zbMATH DE number 4145948
- scientific article; zbMATH DE number 653231
- Automorphism groups of covering graphs
- The 7/5‐conjecture strengthens itself
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?)
- scientific article; zbMATH DE number 107539 (Why is no real title available?)
- scientific article; zbMATH DE number 1161368 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- Generalized reflection groups. II
- The nonexistence of 8-transitive graphs
Cited in
(7)- A family of near-polygonal graphs of valency 10
- A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
- Finite vertex primitive 2-arc regular graphs
- The vertex primitive and vertex bi-primitive \(s\)-arc regular graphs
- A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth
- \(s\)-arc-regular prime-valent Cayley graphs of square-free order
- The path-cycle symmetric function of a digraph
This page was built for publication: Symmetrical path-cycle covers of a graph and polygonal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857413)