Author:
La Hoang,Montassier Mickael,Pinlou Alexandre,Valicov Petru
Funder
Agence Nationale de la Recherche
Subject
Discrete Mathematics and Combinatorics
Reference38 articles.
1. Every planar map is four colorable. Part I. Discharging;Appel;Illinois J. Math.,1977
2. Every planar map is four colorable. Part II. Reducibility;Appel;Illinois J. Math.,1977
3. Planar graphs of girth at least five are square (Δ+2)-choosable;Bonamy;J. Combin. Theory Ser. B,2019
4. 2-distance coloring of sparse graphs;Bonamy;J. Graph Theory,2014
5. Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable;Bonamy;Discrete Math.,2014
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献