Pages that link to "Item:Q1579552"
From MaRDI portal
The following pages link to The complexity of \(H\)-colouring of bounded degree graphs (Q1579552):
Displaying 16 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- Häggkvist-Hell graphs: A class of Kneser-colorable graphs (Q764869) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Homomorphisms of hexagonal graphs to odd cycles (Q1827797) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Cuts and bounds (Q2575795) (← links)
- (Q5075768) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- (Q6065467) (← links)
