The following pages link to (Q5091252):
Displaying 7 items.
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- A Complexity Trichotomy for Approximately Counting List <i>H</i> -Colorings (Q4973886) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- On the approximation of Min Split-coloring and Min Cocoloring (Q5301394) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710819) (← links)
- Two generalizations of proper coloring: hardness and approximability (Q6168932) (← links)
- Bi-arc digraphs: recognition algorithm and applications (Q6547945) (← links)