The following pages link to (Q3758852):
Displaying 11 items.
- On the complexity of the flow coloring problem (Q499367) (← links)
- The complexity of infinite \(H\)-colouring (Q1333335) (← links)
- The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- On the complexity of coloring areflexive \(h\)-ary relations with given permutation group (Q2715944) (← links)
- Structure Learning of $H$-colorings (Q4617600) (← links)
- A Complexity Trichotomy for Approximately Counting List <i>H</i> -Colorings (Q4973886) (← links)
- (Q5091252) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710819) (← links)
- On a coloring conjecture of Hajós (Q5964996) (← links)