Author:
La Hoang,Montassier Mickael
Funder
Agence Nationale de la Recherche
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference28 articles.
1. Bonamy M, Cranston D, Postle L (2019) Planar graphs of girth at least five are square ($$\Delta +2$$)-choosable. J of Comb Theory, Ser B 134:218–238
2. Bonamy M, Lévêque B, Pinlou A (2014) 2-distance coloring of sparse graphs. J of Graph Theory 77(3):190–218
3. Bonamy M, Lévêque B, Pinlou A (2014) Graphs with maximum degree $$\Delta \ge 17$$ and maximum average degree less than 3 are list 2-distance ($$\Delta + 2$$)-colorable. Discrete Math 317:19–32
4. Borodin OV, Glebov AN, Ivanova AO, Neutroeva TK, Tashkinov VA (2004) Sufficient conditions for the 2-distance ($$\Delta +1$$)-colorability of plane graphs. Sibirskie Elektronnye Matematicheskie Izvestiya 1:129–141
5. Borodin OV, Ivanova AO (2012) List 2-facial 5-colorability of plane graphs with girth at least 12. Discrete Math 312:306–314
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献