Pages that link to "Item:Q1387740"
From MaRDI portal
The following pages link to A survey on Hedetniemi's conjecture (Q1387740):
Displaying 50 items.
- Some properties on the tensor product of graphs obtained by monogenic semigroups (Q272447) (← links)
- Square-free graphs are multiplicative (Q345100) (← links)
- Hedetniemi's conjecture for Kneser hypergraphs (Q530765) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- Hedetniemi's conjecture and dense Boolean lattices (Q634737) (← links)
- Interleaved adjoints of directed graphs (Q648963) (← 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)
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs (Q741756) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- A note on the Poljak-Rödl function (Q782938) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Maximum independent sets in direct products of cycles or trees with arbitrary graphs (Q891314) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← 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)
- Chromatic Ramsey numbers (Q1584391) (← links)
- On Hedetniemi's conjecture and the colour template scheme (Q1613520) (← links)
- Altermatic number of categorical product of graphs (Q1709531) (← links)
- On 3-colorings of direct products of graphs (Q1717192) (← links)
- Density via duality. (Q1853500) (← links)
- Lattices arising in categorial investigations of Hedetniemi's conjecture (Q1917488) (← links)
- Hedetniemi's conjecture and fiber products of graphs (Q1928633) (← links)
- Note on Hedetniemi's conjecture and the Poljak-Rödl function (Q2058954) (← links)
- A survey on the Eisenbud-Green-Harris conjecture (Q2080074) (← 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)
- Relatively small counterexamples to Hedetniemi's conjecture (Q2221923) (← links)
- Hedetniemi's conjecture is asymptotically false (Q2221935) (← 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 maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- On the General Coloring Problem (Q3003475) (← links)
- Strongly Projective Graphs (Q3153537) (← links)
- (Q3313895) (← links)
- (Q3424894) (← links)
- Behzad-Vizing conjecture and Cartesian product graphs (Q3439171) (← links)
- A note on the chromatic number of the alternative negation of two graphs (Q3818335) (← links)
- An approach to hedetniemi's conjecture (Q4020700) (← links)
- Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← 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)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)
