The following pages link to Applications of product colouring (Q4046069):
Displaying 34 items.
- Some properties on the tensor product of graphs obtained by monogenic semigroups (Q272447) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Dualities and dual pairs in Heyting algebras (Q603889) (← links)
- Maximum independent sets in direct products of cycles or trees with arbitrary graphs (Q891314) (← links)
- Subgraphs of colour-critical graphs (Q1101121) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- On a product dimension of graphs (Q1142231) (← links)
- Set colourings of graphs (Q1255964) (← links)
- On sparse graphs with given colorings and homomorphisms. (Q1425116) (← links)
- Non-trivially intersecting multi-part families (Q1703447) (← links)
- On 3-colorings of direct products of graphs (Q1717192) (← links)
- Stable sets of maximal size in Kneser-type graphs (Q1827339) (← links)
- Nearly bipartite graphs with large chromatic number (Q1839258) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- On robust colorings of Hamming-distance graphs (Q1991409) (← links)
- Vector coloring the categorical product of graphs (Q2191770) (← links)
- On graph fall-coloring: existence and constructions (Q2287754) (← links)
- Fourier analysis and large independent sets in powers of complete graphs (Q2464160) (← links)
- Set colourings of graphs. (Reprint) (Q2497995) (← links)
- Maximum stable sets in analogs of Kneser and complete graphs (Q2519792) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Logical compactness and constraint satisfaction problems (Q2980963) (← links)
- High-girth cubic graphs are homomorphic to the Clebsch graph (Q3083411) (← links)
- Projectivity and independent sets in powers of graphs (Q3150193) (← links)
- Vertex isoperimetry and independent set stability for tensor powers of cliques (Q5002636) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- KKL's influence on me (Q6198636) (← links)
- A note on acyclic coloring of strong product of graphs (Q6571585) (← links)
- On the maximum number of edges in \(k\)-critical graphs (Q6632786) (← links)
