The following pages link to Polynomial graph-colorings (Q1183345):
Displaying 38 items.
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- The complexity of colouring by locally semicomplete digraphs (Q709314) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- Graph homomorphisms with infinite targets (Q1336635) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
- \(\sigma\)-polynomials and graph coloring (Q1891610) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- Graph polynomials and group coloring of graphs (Q2122688) (← links)
- The \(C_{k}\)-extended graft construction (Q2275937) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
- Adjusted interval digraphs (Q2839215) (← links)
- Polynomial instances of the packing coloring problem (Q2840736) (← links)
- CSP dichotomy for special polyads (Q2852579) (← links)
- The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
- CSP dichotomy for special triads (Q3395563) (← links)
- Path homomorphisms (Q4892428) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- (Q5005172) (← links)
- (Q5091252) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
- Min-Orderable Digraphs (Q5130576) (← links)
- Faster graph coloring in polynomial space (Q5920158) (← links)
- Learning logic programs with structured background knowledge (Q5941133) (← links)
- The smallest hard trees (Q6073305) (← links)
