Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. 3-choosability of triangle-free planar graphs with constraints on 4-cycles;Dvořák;SIAM Journal on Discrete Mathematics,2010
2. Choosability in graphs;Erdös;Congressus Numerantium,1979
3. On 3-choosable planar graphs of girth at least 4;Li;Discrete Mathematics,2009
4. 3-list-coloring planar graphs of girth 5;Thomassen;Journal of Combinatorial Theory, Series B,1995
5. Coloring the vertices of a graph in prescribed colors;Vizing;Diskretnyi˘ Analiz,1976
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Facial Colorings of Plane Graphs;Journal of Interconnection Networks;2019-03
2. Ollivier’s Ricci curvature and the coloring of graphs;European Journal of Combinatorics;2013-07