Pages that link to "Item:Q3815317"

The following pages link to On the chromatic number of the product of graphs (Q3815317):

Displaying 43 items.

• Dichromatic polynomial of product digraphs (Q327643) (← links)
• Square-free graphs are multiplicative (Q345100) (← links)
• On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs (Q401157) (← links)
• Equitable colorings of Kronecker products of graphs (Q602760) (← links)
• On optimizing edge connectivity of product graphs (Q626866) (← links)
• Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs (Q741756) (← links)
• On the chromatic number and independence number of hypergraph products (Q858686) (← links)
• The chromatic number of the product of two 4-chromatic graphs is 4 (Q1063620) (← 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)
• Achromatic numbers and graph operations (Q1201263) (← links)
• The chromatic difference sequence of the Cartesian product of graphs. II (Q1208488) (← links)
• Multiplicativity of acyclic local tournaments (Q1276271) (← links)
• Homomorphisms to oriented cycles (Q1316647) (← links)
• Multiplicativity of acyclic digraphs (Q1377696) (← links)
• A survey on Hedetniemi's conjecture (Q1387740) (← links)
• Chromatic Ramsey numbers (Q1584391) (← links)
• On Hedetniemi's conjecture and the colour template scheme (Q1613520) (← links)
• Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
• On the \(b\)-chromatic number of Cartesian products (Q1706119) (← links)
• Lattices arising in categorial investigations of Hedetniemi's conjecture (Q1917488) (← links)
• Coloring graph products---a survey (Q1923489) (← links)
• Hedetniemi's conjecture and fiber products of graphs (Q1928633) (← links)
• Vector coloring the categorical product of graphs (Q2191770) (← links)
• Counterexamples to Hedetniemi's conjecture (Q2274002) (← links)
• Strengthening topological colorful results for graphs (Q2359976) (← links)
• Universal completability, least eigenvalue frameworks, and vector colorings (Q2408207) (← links)
• Chromatic numbers and products (Q2570106) (← links)
• Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs (Q2673495) (← links)
• Projectivity and independent sets in powers of graphs (Q3150193) (← links)
• (Q3581871) (← links)
• A note on the chromatic number of the alternative negation of two graphs (Q3818335) (← links)
• Coloring digraphs by iterated antichains (Q3990225) (← links)
• An approach to hedetniemi's conjecture (Q4020700) (← links)
• (Q4033013) (← links)
• Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
• An edge coloring problem for graph products (Q4715283) (← links)
• The chromatic number of the product of two graphs is at least half the minimum of the fractional chromatic numbers of the factors. (Q4828856) (← links)
• The thickness of the Kronecker product of graphs (Q4988856) (← links)
• On <i>r</i>-dynamic chromatic number of some brick product graphs <i>C</i>(2<i>n</i>, 1, <i>p</i>) (Q5083048) (← links)
• Applications of Hajós‐Type Constructions to the Hedetniemi Conjecture (Q5272936) (← links)
• Hedetniemi's conjecture and the retracts of a product of graphs (Q5932754) (← links)
• (Q6081526) (← links)