Pages that link to "Item:Q3967554"
From MaRDI portal
The following pages link to Constructing 5-Arc-Transitive Cubic Graphs (Q3967554):
Displaying 15 items.
- Arc-transitive regular cyclic covers of the complete bipartite graph \(\mathsf{K}_{p,p}\) (Q494307) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- The sextet construction for cubic graphs (Q1055779) (← links)
- Infinite coverings of cages (Q1061748) (← links)
- Some computational aspects of solvable regular covers of graphs (Q2343238) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Arc-transitive abelian regular covers of cubic graphs (Q2438898) (← links)
- Countable locally 2-arc-transitive bipartite graphs (Q2441953) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Arc-transitive cyclic and dihedral covers of pentavalent symmetric graphs of order twice a prime (Q4629561) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
