Hedetniemijeva domneva (Slovenian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hedetniemijeva domneva" in Slovenian language version.

refsWebsite

Global rank Slovenian rank

2^nd place

5^th place

451^st place

701^st place

69^th place

79^th place

6,028^th place

low place

low place

18^th place

31^st place

ams.org

El-Zahar; Sauer (1985). El-Zahar, Mohamed; Sauer, Norbert (1985), »The chromatic number of the product of two 4-chromatic graphs is 4«, Combinatorica, 5 (2): 121–126, doi:10.1007/BF02579374, MR 0815577
Häggkvist idr. (1988). Häggkvist, R.; Hell, Pavol; Miller, D. J.; Neumann-Lara, Victor (1988), »On multiplicative graphs and the product conjecture«, Combinatorica, 8 (1): 63–74, doi:10.1007/BF02122553, MR 0951994
Hajnal (1985). Hajnal, András (1985), »The chromatic number of the product of two ℵ₁ chromatic graphs can be countable«, Combinatorica, 5 (2): 137–140, doi:10.1007/BF02579376, MR 0815579
Sabidussi (1957). Sabidussi, Gert (1957), »Graphs with given group and given graph-theoretical properties«, Canadian Journal of Mathematics, 9: 515–525, doi:10.4153/CJM-1957-060-7, MR 0094810

Šitov (2019). Šitov, Jaroslav Nikolajevič (Maj 2019), Counterexamples to Hedetniemi's conjecture, arXiv:1905.02167
Rinot (2013). Rinot, Assaf (2013), Hedetniemi's conjecture for uncountable graphs, arXiv:1307.6841, Bibcode:2013arXiv1307.6841R
Foniok; Tardif (2016). Foniok, Jan; Tardif, Claude (9. avgust 2016), Hedetniemi's conjecture and adjoint functors in thin categories, arXiv:1608.02918

El-Zahar; Sauer (1985). El-Zahar, Mohamed; Sauer, Norbert (1985), »The chromatic number of the product of two 4-chromatic graphs is 4«, Combinatorica, 5 (2): 121–126, doi:10.1007/BF02579374, MR 0815577
Poljak; Rödl (1981). Poljak, Svatopluk; Rödl, Vojtěch (1981), »On the arc-chromatic number of a digraph«, Journal of Combinatorial Theory, Series B, 31 (2): 190–198, doi:10.1016/S0095-8956(81)80024-X
Häggkvist idr. (1988). Häggkvist, R.; Hell, Pavol; Miller, D. J.; Neumann-Lara, Victor (1988), »On multiplicative graphs and the product conjecture«, Combinatorica, 8 (1): 63–74, doi:10.1007/BF02122553, MR 0951994
Tardif (2005). Tardif, Claude (2005), »Multiplicative graphs and semi-lattice endomorphisms in the category of graphs«, Journal of Combinatorial Theory, Series B, 95 (2): 338–345, doi:10.1016/j.jctb.2005.06.002
Tardif; Wehlau (2006). Tardif, Claude; Wehlau, David (2006), »Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function«, Journal of Graph Theory, 51 (1): 33–36, doi:10.1002/jgt.20117
Hajnal (1985). Hajnal, András (1985), »The chromatic number of the product of two ℵ₁ chromatic graphs can be countable«, Combinatorica, 5 (2): 137–140, doi:10.1007/BF02579376, MR 0815579
Sabidussi (1957). Sabidussi, Gert (1957), »Graphs with given group and given graph-theoretical properties«, Canadian Journal of Mathematics, 9: 515–525, doi:10.4153/CJM-1957-060-7, MR 0094810

Rinot (2013). Rinot, Assaf (2013), Hedetniemi's conjecture for uncountable graphs, arXiv:1307.6841, Bibcode:2013arXiv1307.6841R

Potanov (2019). Potanov, Vladimir (30. maj 2019), »В поисках хроматического числа«, N+1 (v ruščini), pridobljeno 30. maja 2019