Pages that link to "Item:Q3968465"
From MaRDI portal
The following pages link to On the complexity of the general coloring problem (Q3968465):
Displaying 26 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- On Sabidussi--Fawcett subdirect representation (Q686305) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- Symmetric graphs and interpretations (Q798680) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- The effect of two cycles on the complexity of colourings by directed graphs (Q911612) (← links)
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- Homomorphisms of 3-chromatic graphs (Q1062066) (← links)
- Concerning the achromatic number of graphs (Q1065819) (← links)
- On the complexity of H-coloring (Q1100215) (← links)
- Polynomial graph-colorings (Q1183345) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- Graph homomorphisms with infinite targets (Q1336635) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs (Q1421519) (← links)
- Homomorphisms of hexagonal graphs to odd cycles (Q1827797) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- On the General Coloring Problem (Q3003475) (← links)
- Path homomorphisms (Q4892428) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
- (Q6065467) (← links)
