On the complexity of the general coloring problem
From MaRDI portal
Cited in
(31)- Dichotomy for bounded degree \(H\)-colouring
- Homomorphisms of 3-chromatic graphs
- Concerning the achromatic number of graphs
- On the complexity of H-coloring
- Polynomial graph-colorings
- Homomorphisms to oriented cycles
- Graph homomorphisms with infinite targets
- Homomorphisms to oriented paths
- The complexity of restricted graph homomorphisms
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Homomorphisms of hexagonal graphs to odd cycles
- Hereditarily hard \(H\)-colouring problems
- Complexity of tree homomorphisms
- Dichotomy for finite tournaments of mixed-type
- On the general coloring problem
- Path homomorphisms
- Polynomial graph-colorings
- Graph theory (algorithmic, algebraic, and metric problems)
- Sparsification lower bounds for list \(H\)-coloring
- On the complexity of colouring by superdigraphs of bipartite graphs
- On Sabidussi--Fawcett subdirect representation
- Sparsification lower bounds for list H-coloring
- Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
- List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
- Homomorphisms of (n,m)-graphs with respect to generalised switch
- Kernelization for H-coloring
- \(H\)-coloring degree-bounded (acyclic) digraphs
- Symmetric graphs and interpretations
- Digraph matrix partitions and trigraph homomorphisms
- List homomorphisms of graphs with bounded degrees
- The effect of two cycles on the complexity of colourings by directed graphs
This page was built for publication: On the complexity of the general coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968465)
