Pages that link to "Item:Q1003659"
From MaRDI portal
The following pages link to Dichotomy for bounded degree \(H\)-colouring (Q1003659):
Displaying 9 items.
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
- On bounded treewidth duality of graphs (Q4894618) (← links)
- (Q5091252) (← links)
- Logical Approaches to Computational Barriers (Q5898832) (← links)
- Colorings and homomorphisms of degenerate and bounded degree graphs (Q5936036) (← links)
- (Q6065467) (← links)