Pages that link to "Item:Q2370448"
From MaRDI portal
The following pages link to Complexity issues on bounded restrictive \(H\)-coloring (Q2370448):
Displaying 8 items.
- Compactors for parameterized counting problems (Q826317) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- Algorithms – ESA 2004 (Q5464586) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710819) (← links)