Constructing 5-Arc-Transitive Cubic Graphs
From MaRDI portal
Cited in
(19)- The sextet construction for cubic graphs
- Infinite coverings of cages
- Some computational aspects of solvable regular covers of graphs
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Locally constrained graph homomorphisms and equitable partitions
- Arc-transitive abelian regular covers of cubic graphs
- Countable locally 2-arc-transitive bipartite graphs
- Packing bipartite graphs with covers of complete bipartite graphs
- Comparing Universal Covers in Polynomial Time
- Arc-transitive cyclic and dihedral covers of pentavalent symmetric graphs of order twice a prime
- Arc-transitive regular cyclic covers of the complete bipartite graph \(\mathsf{K}_{p,p}\)
- An algorithmic framework for locally constrained homomorphisms
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- An algorithmic framework for locally constrained homomorphisms
- Computational complexity of covering coloured mixed multigraphs with simple degree partitions
- Computing role assignments of chordal graphs
- Computational complexity of covering regular trees
- A complete complexity classification of the role assignment problem
- Comparing universal covers in polynomial time
This page was built for publication: Constructing 5-Arc-Transitive Cubic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967554)
