From the 1-2-3 conjecture to the Riemann hypothesis
暂无分享,去创建一个
[1] Jaroslaw Grytczuk,et al. Lucky labelings of graphs , 2009, Inf. Process. Lett..
[2] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[3] Florian Pfender,et al. Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture , 2010, J. Comb. Theory B.
[4] Jaroslaw Grytczuk,et al. Graph coloring and Graham's greatest common divisor problem , 2018, Discret. Math..
[5] Xuding Zhu,et al. Total weight choosability of graphs , 2011, J. Graph Theory.
[6] Jaroslaw Grytczuk,et al. Additive Coloring of Planar Graphs , 2014, Graphs Comb..
[7] Mario Szegedy. The solution of graham’s greatest common divisor problem , 1986, Comb..
[8] Jakub Przybylo,et al. The 1-2-3 Conjecture almost holds for regular graphs , 2018, J. Comb. Theory, Ser. B.
[9] Stephan Kreutzer,et al. Majority Colourings of Digraphs , 2016, Electron. J. Comb..
[10] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[11] Bojan Vuckovic,et al. Multi-set neighbor distinguishing 3-edge coloring , 2018, Discret. Math..
[12] Jakub Przybylo,et al. On a 1, 2 Conjecture , 2010, Discret. Math. Theor. Comput. Sci..
[13] Noga Alon. Combinatorial Nullstellensatz , 1999, Combinatorics, Probability and Computing.
[14] G. Pólya,et al. Verschiedene Bemerkungen zur Zahlentheorie. , 1919 .
[15] Peter Borwein,et al. Completely multiplicative functions taking values in $\{-1,1\}$ , 2008, 0809.1691.
[16] Xuding Zhu,et al. Every graph is (2,3)-choosable , 2016, Comb..
[17] Florian Pfender,et al. The 1‐2‐3‐Conjecture for Hypergraphs , 2013, J. Graph Theory.
[18] T. Apostol. Introduction to analytic number theory , 1976 .
[19] Andrzej Dudek,et al. Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs , 2015, Electron. J. Comb..
[20] Andrzej Dudek,et al. On the complexity of vertex-coloring edge-weightings , 2011, Discret. Math. Theor. Comput. Sci..
[21] Bruce A. Reed,et al. Degree constrained subgraphs , 2005, Discret. Appl. Math..
[22] K. Soundararajan. Tao’s resolution of the Erdős discrepancy problem , 2017 .
[23] Kannan Soundararajan,et al. On a conjecture of R. L. Graham , 1996 .
[24] P. Borwein,et al. The Riemann Hypothesis , 2008 .
[25] Jakub Przybylo,et al. Total Weight Choosability of Graphs , 2011, Electron. J. Comb..
[26] Jaroslaw Grytczuk,et al. Weight choosability of graphs , 2009, J. Graph Theory.
[27] A. Thomason,et al. Edge weights and vertex colours , 2004 .
[28] Danna Zhou,et al. d. , 1840, Microbial pathogenesis.
[29] Zaharescu Alexandru. On a conjecture of Graham , 1987 .
[30] P. Erdos. Some unsolved problems. , 1957 .
[31] Terence Tao,et al. The Erdos discrepancy problem , 2015, 1509.05363.
[32] Jaroslaw Grytczuk,et al. Thue type problems for graphs, points, and numbers , 2008, Discret. Math..
[33] P'eter P'al Pach,et al. Coloring the $n$-Smooth Numbers with $n$ Colors , 2019, Electron. J. Comb..