Pages that link to "Item:Q458463"
From MaRDI portal
The following pages link to Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463):
Displaying 26 items.
- On incidence coloring conjecture in Cartesian products of graphs (Q313802) (← links)
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- Universality of intervals of line graph order (Q740276) (← links)
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
- Mike Fellows: Weaving the Web of Mathematics and Adventure (Q2908534) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
- Unfoldings and Coverings of Weighted Graphs (Q6094515) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)