, Coloring Graphs with Sparse Neighborhoods, Journal of Combinatorial Theory, Series B, vol.77, issue.1, pp.73-82, 1999.
DOI : 10.1006/jctb.1999.1910
URL : https://doi.org/10.1006/jctb.1999.1910
, The Chromatic Number of Graph Powers, Combinatorics, Probability and Computing, vol.11, issue.01, pp.1-10, 2002.
DOI : 10.1017/S0963548301004965
, Extremal Graph Theory, 1978.
DOI : 10.1201/b16132-57
, Cycles of even length in graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.2, pp.97-105, 1974.
DOI : 10.1016/0095-8956(74)90052-5
, Problems and results in combinatorial analysis and graph theory, Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, pp.81-92, 1986.
, The nonexistence of certain generalized polygons, Journal of Algebra, vol.1, issue.2, pp.114-131, 1964.
DOI : 10.1016/0021-8693(64)90028-6
, Asymptotic choice number for triangle-free graphs, DIMACS, 1996.
, The Distance-t Chromatic Index of Graphs, Combinatorics, Probability and Computing, vol.11, issue.01, pp.90-101, 2014.
DOI : 10.1006/jctb.1997.1724
, Coloring Powers and Girth, SIAM Journal on Discrete Mathematics, vol.30, issue.4, pp.1938-1949, 2016.
DOI : 10.1137/15M1035422
, The strong chromatic index of C 4 -free graphs. Random Structures Algorithms, pp.357-375, 2000.
, The list chromatic number of graphs with small clique number, 2017.
, A note on the Tur??n function of even cycles, Proc. Amer, pp.3687-3692, 2012.
DOI : 10.1090/S0002-9939-2012-11274-2
, SOME UNSOLVED PROBLEMS IN GRAPH THEORY, Russian Mathematical Surveys, vol.23, issue.6, pp.117-134, 1968.
DOI : 10.1070/RM1968v023n06ABEH001252
, A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs, Combinatorics, Probability and Computing, vol.11, issue.01, pp.103-111, 2002.
DOI : 10.1017/S0963548301004898