Constructing 5-Arc-Transitive Cubic Graphs
From MaRDI portal
Publication:3967554
DOI10.1112/jlms/s2-26.2.193zbMath0502.05029OpenAlexW1990501236MaRDI QIDQ3967554
Publication date: 1982
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-26.2.193
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
An algorithmic framework for locally constrained homomorphisms, Comparing Universal Covers in Polynomial Time, 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, 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}\), Computing role assignments of chordal graphs, Comparing universal covers in polynomial time, The sextet construction for cubic graphs, Some computational aspects of solvable regular covers of graphs, Infinite coverings of cages, Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree, A complete complexity classification of the role assignment problem
