The following pages link to Covering regular graphs (Q1386472):
Displayed 7 items.
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Digital products, wedges, and covering spaces (Q851831) (← links)
- Upper bounds and algorithms for parallel knock-out numbers (Q1008728) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)