Hadwiger conjecture (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hadwiger conjecture (graph theory)" in English language version.

refsWebsite

Global rank English rank

10ams.org

451^st place

277^th place

9doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

1renyi.hu

low place

1handle.net

102^nd place

76^th place

1arxiv.org

69^th place

59^th place

1cwi.nl

low place

ams.org

mathscinet.ams.org

Diestel (2017). Diestel, Reinhard (2017), "7.3 Hadwiger's conjecture", Graph Theory, Graduate Texts in Mathematics, vol. 173 (5th ed.), Springer, Berlin, pp. 183–186, ISBN 978-3-662-57560-4, MR 3822066
Nešetřil & Thomas (1985). Nešetřil, Jaroslav; Thomas, Robin (1985), "A note on spatial representation of graphs", Commentationes Mathematicae Universitatis Carolinae, 26 (4): 655–659, hdl:10338.dmlcz/106404, MR 0831801
Kostochka (1984). The letter $O$ in this expression invokes big O notation. Kostochka, A. V. (1984), "Lower bound of the Hadwiger number of graphs by their average degree", Combinatorica, 4 (4): 307–316, doi:10.1007/BF02579141, MR 0779891, S2CID 15736799
Kostochka (1984). Kostochka, A. V. (1984), "Lower bound of the Hadwiger number of graphs by their average degree", Combinatorica, 4 (4): 307–316, doi:10.1007/BF02579141, MR 0779891, S2CID 15736799
Thomason (1984). Thomason, Andrew (1984), "An extremal function for contractions of graphs", Mathematical Proceedings of the Cambridge Philosophical Society, 95 (2): 261–265, doi:10.1017/S0305004100061521, MR 0735367, S2CID 124801301
Delcourt & Postle (2021); Norin, Postle & Song (2023) Delcourt, Michelle; Postle, Luke (2021), Reducing linear Hadwiger's conjecture to coloring small graphs, arXiv:2108.01633 Norin, Sergey; Postle, Luke; Song, Zi-Xia (2023), "Breaking the degeneracy barrier for coloring graphs with no $K_{t}$ minor", Advances in Mathematics, 422, Paper No. 109020, 23pp, arXiv:1910.09378, doi:10.1016/j.aim.2023.109020, MR 4576840
Yu & Zickfeld (2006). Yu, Xingxing; Zickfeld, Florian (2006), "Reducing Hajós' 4-coloring conjecture to 4-connected graphs", Journal of Combinatorial Theory, Series B, 96 (4): 482–492, doi:10.1016/j.jctb.2005.10.001, MR 2232386
Voigt (1993); Thomassen (1994). Voigt, Margit (1993), "List colourings of planar graphs", Discrete Mathematics, 120 (1–3): 215–219, doi:10.1016/0012-365X(93)90579-I, MR 1235909 Thomassen, Carsten (1994), "Every planar graph is 5-choosable", Journal of Combinatorial Theory, Series B, 62 (1): 180–181, doi:10.1006/jctb.1994.1062, MR 1290638
Geelen et al. (2006); Kawarabayashi (2009). Geelen, Jim; Gerards, Bert; Reed, Bruce; Seymour, Paul; Vetta, Adrian (2006), "On the odd-minor variant of Hadwiger's conjecture", Journal of Combinatorial Theory, Series B, 99 (1): 20–29, doi:10.1016/j.jctb.2008.03.006 Kawarabayashi, Ken-ichi (2009), "Note on coloring graphs without odd- $K k$ -minors", Journal of Combinatorial Theory, Series B, 99 (4): 728–731, doi:10.1016/j.jctb.2008.12.001, MR 2518204

ams.org

Pegg (2002). Pegg, Ed Jr. (2002), "Book Review: The Colossal Book of Mathematics" (PDF), Notices of the American Mathematical Society, 49 (9): 1084–1086

arxiv.org

Delcourt & Postle (2021); Norin, Postle & Song (2023) Delcourt, Michelle; Postle, Luke (2021), Reducing linear Hadwiger's conjecture to coloring small graphs, arXiv:2108.01633 Norin, Sergey; Postle, Luke; Song, Zi-Xia (2023), "Breaking the degeneracy barrier for coloring graphs with no $K_{t}$ minor", Advances in Mathematics, 422, Paper No. 109020, 23pp, arXiv:1910.09378, doi:10.1016/j.aim.2023.109020, MR 4576840

cwi.nl

ir.cwi.nl

Geelen et al. (2006); Kawarabayashi (2009). Geelen, Jim; Gerards, Bert; Reed, Bruce; Seymour, Paul; Vetta, Adrian (2006), "On the odd-minor variant of Hadwiger's conjecture", Journal of Combinatorial Theory, Series B, 99 (1): 20–29, doi:10.1016/j.jctb.2008.03.006 Kawarabayashi, Ken-ichi (2009), "Note on coloring graphs without odd- $K k$ -minors", Journal of Combinatorial Theory, Series B, 99 (4): 728–731, doi:10.1016/j.jctb.2008.12.001, MR 2518204

doi.org

Bollobás, Catlin & Erdős (1980). Bollobás, B.; Catlin, P. A.; Erdős, Paul (1980), "Hadwiger's conjecture is true for almost every graph" (PDF), European Journal of Combinatorics, 1 (3): 195–199, doi:10.1016/s0195-6698(80)80001-1
The existence of either a $K_{7}$ or $K_{3,5}$ minor was shown by Ken-ichi Kawarabayashi, and Kawarabayashi & Toft (2005) proved the existence of either a $K_{7}$ or $K_{4,4}$ minor. Kawarabayashi, Ken-ichi; Toft, Bjarne (2005), "Any 7-chromatic graph has $K 7$ or $K 4,4$ as a minor", Combinatorica, 25 (3): 327–353, doi:10.1007/s00493-005-0019-1, S2CID 41451753
Kostochka (1984). The letter $O$ in this expression invokes big O notation. Kostochka, A. V. (1984), "Lower bound of the Hadwiger number of graphs by their average degree", Combinatorica, 4 (4): 307–316, doi:10.1007/BF02579141, MR 0779891, S2CID 15736799
Kostochka (1984). Kostochka, A. V. (1984), "Lower bound of the Hadwiger number of graphs by their average degree", Combinatorica, 4 (4): 307–316, doi:10.1007/BF02579141, MR 0779891, S2CID 15736799
Thomason (1984). Thomason, Andrew (1984), "An extremal function for contractions of graphs", Mathematical Proceedings of the Cambridge Philosophical Society, 95 (2): 261–265, doi:10.1017/S0305004100061521, MR 0735367, S2CID 124801301
Delcourt & Postle (2021); Norin, Postle & Song (2023) Delcourt, Michelle; Postle, Luke (2021), Reducing linear Hadwiger's conjecture to coloring small graphs, arXiv:2108.01633 Norin, Sergey; Postle, Luke; Song, Zi-Xia (2023), "Breaking the degeneracy barrier for coloring graphs with no $K_{t}$ minor", Advances in Mathematics, 422, Paper No. 109020, 23pp, arXiv:1910.09378, doi:10.1016/j.aim.2023.109020, MR 4576840
Yu & Zickfeld (2006). Yu, Xingxing; Zickfeld, Florian (2006), "Reducing Hajós' 4-coloring conjecture to 4-connected graphs", Journal of Combinatorial Theory, Series B, 96 (4): 482–492, doi:10.1016/j.jctb.2005.10.001, MR 2232386
Voigt (1993); Thomassen (1994). Voigt, Margit (1993), "List colourings of planar graphs", Discrete Mathematics, 120 (1–3): 215–219, doi:10.1016/0012-365X(93)90579-I, MR 1235909 Thomassen, Carsten (1994), "Every planar graph is 5-choosable", Journal of Combinatorial Theory, Series B, 62 (1): 180–181, doi:10.1006/jctb.1994.1062, MR 1290638
Geelen et al. (2006); Kawarabayashi (2009). Geelen, Jim; Gerards, Bert; Reed, Bruce; Seymour, Paul; Vetta, Adrian (2006), "On the odd-minor variant of Hadwiger's conjecture", Journal of Combinatorial Theory, Series B, 99 (1): 20–29, doi:10.1016/j.jctb.2008.03.006 Kawarabayashi, Ken-ichi (2009), "Note on coloring graphs without odd- $K k$ -minors", Journal of Combinatorial Theory, Series B, 99 (4): 728–731, doi:10.1016/j.jctb.2008.12.001, MR 2518204

handle.net

hdl.handle.net

Nešetřil & Thomas (1985). Nešetřil, Jaroslav; Thomas, Robin (1985), "A note on spatial representation of graphs", Commentationes Mathematicae Universitatis Carolinae, 26 (4): 655–659, hdl:10338.dmlcz/106404, MR 0831801

renyi.hu

Bollobás, Catlin & Erdős (1980). Bollobás, B.; Catlin, P. A.; Erdős, Paul (1980), "Hadwiger's conjecture is true for almost every graph" (PDF), European Journal of Combinatorics, 1 (3): 195–199, doi:10.1016/s0195-6698(80)80001-1

semanticscholar.org

api.semanticscholar.org

The existence of either a $K_{7}$ or $K_{3,5}$ minor was shown by Ken-ichi Kawarabayashi, and Kawarabayashi & Toft (2005) proved the existence of either a $K_{7}$ or $K_{4,4}$ minor. Kawarabayashi, Ken-ichi; Toft, Bjarne (2005), "Any 7-chromatic graph has $K 7$ or $K 4,4$ as a minor", Combinatorica, 25 (3): 327–353, doi:10.1007/s00493-005-0019-1, S2CID 41451753
Kostochka (1984). The letter $O$ in this expression invokes big O notation. Kostochka, A. V. (1984), "Lower bound of the Hadwiger number of graphs by their average degree", Combinatorica, 4 (4): 307–316, doi:10.1007/BF02579141, MR 0779891, S2CID 15736799
Kostochka (1984). Kostochka, A. V. (1984), "Lower bound of the Hadwiger number of graphs by their average degree", Combinatorica, 4 (4): 307–316, doi:10.1007/BF02579141, MR 0779891, S2CID 15736799
Thomason (1984). Thomason, Andrew (1984), "An extremal function for contractions of graphs", Mathematical Proceedings of the Cambridge Philosophical Society, 95 (2): 261–265, doi:10.1017/S0305004100061521, MR 0735367, S2CID 124801301