The following pages link to (Q4017175):
Displaying 43 items.
- Unique square property, equitable partitions, and product-like graphs (Q394372) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- Covers of simplicial complexes and applications to geometry (Q802138) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- The combinatorics of \(\tau\)-covers (Q857053) (← links)
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- Upper bounds and algorithms for parallel knock-out numbers (Q1008728) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- Covering regular graphs (Q1386472) (← links)
- The combinatorics of Borel covers (Q1612215) (← links)
- Algorithm for recognizing Cartesian graph bundles (Q1613382) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Combinatorics of unavoidable complexes (Q2011131) (← links)
- Computational complexity of covering disconnected multigraphs (Q2140489) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- On recognition of strong graph bundles (Q2777507) (← links)
- Mike Fellows: Weaving the Web of Mathematics and Adventure (Q2908534) (← links)
- Complexity of Locally Injective Homomorphism to the Theta Graphs (Q3000520) (← links)
- Locally Injective Homomorphism to the Simple Weight Graphs (Q3010426) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- On the Complexity of Planar Covering of Small Graphs (Q3104767) (← links)
- (Q3479151) (← links)
- (Q3481848) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Effective calculations of the degree of ∗-covering (Q4645546) (← links)
- (Q4930059) (← links)
- Small non-Leighton two-complexes (Q5877295) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
- Unfoldings and Coverings of Weighted Graphs (Q6094515) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
- Complexity of graph covering problems (Q6184361) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- Recognizing graph products and bundles (Q6560201) (← links)
- Computational complexity of covering disconnected multigraphs (Q6633538) (← links)
