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 28 items.
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- 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)
- The complexity of colouring problems on dense graphs (Q1079363) (← links)
- On the complexity of H-coloring (Q1100215) (← links)
- A note on restricted \(H\)-colouring (Q1183461) (← links)
- The complexity of some graph colouring problems (Q1192946) (← links)
- The complexity of infinite \(H\)-colouring (Q1333335) (← links)
- The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Homomorphisms of hexagonal graphs to odd cycles (Q1827797) (← links)
- Sparse \(H\)-colourable graphs of bounded maximum degree (Q1889843) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- \(H\)-free coloring on graphs with bounded tree-width (Q2326574) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← 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)
- Colorings and homomorphisms of degenerate and bounded degree graphs (Q5936036) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- (Q6065467) (← links)