Pages that link to "Item:Q1063620"
From MaRDI portal
The following pages link to The chromatic number of the product of two 4-chromatic graphs is 4 (Q1063620):
Displaying 50 items.
- Square-free graphs are multiplicative (Q345100) (← links)
- Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers (Q345126) (← links)
- On optimizing edge connectivity of product graphs (Q626866) (← links)
- Hedetniemi's conjecture and dense Boolean lattices (Q634737) (← links)
- The fractional version of Hedetniemi's conjecture is true (Q648973) (← links)
- The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture (Q648993) (← links)
- On idomatic partitions of direct products of complete graphs (Q659730) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- On topological relaxations of chromatic conjectures (Q710730) (← links)
- A note on the Poljak-Rödl function (Q782938) (← links)
- On the restricted homomorphism problem (Q948709) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable (Q1063621) (← links)
- On multiplicative graphs and the product conjecture (Q1110530) (← links)
- A simple proof of the multiplicativity of directed cycles of prime power length (Q1193732) (← links)
- Multiplicative posets (Q1198481) (← links)
- Achromatic numbers and graph operations (Q1201263) (← links)
- Multiplicativity of acyclic local tournaments (Q1276271) (← links)
- Borel chromatic numbers (Q1279827) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- Multiplicativity of acyclic digraphs (Q1377696) (← links)
- Chromatic Ramsey numbers (Q1584391) (← links)
- On 3-colorings of direct products of graphs (Q1717192) (← links)
- Generic automorphisms and graph coloring (Q1772278) (← links)
- Density via duality. (Q1853500) (← links)
- Lattices arising in categorial investigations of Hedetniemi's conjecture (Q1917488) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- Note on Hedetniemi's conjecture and the Poljak-Rödl function (Q2058954) (← links)
- Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers (Q2084794) (← links)
- The chromatic number of the product of 14-chromatic graphs can be 13 (Q2151188) (← links)
- Vector coloring the categorical product of graphs (Q2191770) (← links)
- Relatively small counterexamples to Hedetniemi's conjecture (Q2221923) (← links)
- Hedetniemi's conjecture is asymptotically false (Q2221935) (← links)
- A complexity problem for Borel graphs (Q2238048) (← links)
- Counterexamples to Hedetniemi's conjecture (Q2274002) (← links)
- A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function (Q2278108) (← links)
- \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture (Q2324631) (← links)
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture (Q2338641) (← links)
- On 3-chromatic distance-regular graphs (Q2384050) (← links)
- Critical graphs without triangles: an optimum density construction (Q2439835) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- Chromatic numbers and products (Q2570106) (← links)
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs (Q2573651) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- The categorical product of two 5-chromatic digraphs can be 3-chromatic (Q2581426) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs (Q2673495) (← links)
- Fractional chromatic numbers of cones over graphs (Q2757095) (← links)
- Coloring the Cartesian Sum of Graphs (Q3439356) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
