Pages that link to "Item:Q5931456"
From MaRDI portal
The following pages link to Hedetniemi's conjecture---a survey (Q5931456):
Displaying 37 items.
- Square-free graphs are multiplicative (Q345100) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- Hedetniemi's conjecture and dense Boolean lattices (Q634737) (← links)
- The fractional version of Hedetniemi's conjecture is true (Q648973) (← links)
- On idomatic partitions of direct products of complete graphs (Q659730) (← links)
- A note on the Poljak-Rödl function (Q782938) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- A survey on Hedetniemi's conjecture (Q1387740) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- Planar graphs are \(9/2\)-colorable (Q1791701) (← 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)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Graph exponentiation and neighborhood reconstruction (Q2214326) (← 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)
- Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs (Q2332386) (← 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)
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- Chromatic numbers and products (Q2570106) (← links)
- The categorical product of two 5-chromatic digraphs can be 3-chromatic (Q2581426) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- Hedetniemi's conjecture from the topological viewpoint (Q2680825) (← links)
- On the General Coloring Problem (Q3003475) (← links)
- (Q3424894) (← links)
- An approach to hedetniemi's conjecture (Q4020700) (← 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)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- Hedetniemi's conjecture and the retracts of a product of graphs (Q5932754) (← links)
- Turán numbers of several bipartite graphs (Q6184156) (← links)
