Author:
Borodin O.V.,Ivanova A.O.,Montassier M.,Raspaud A.
Funder
Russian Foundation for Basic Research
President of Russia
ANR Project GRATOS
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 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. Near proper 2-coloring the vertices of sparse graphs;Borodin;Discrete Anal. Oper. Res.,2009
4. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k;Borodin;J. Graph Theory,2010
5. O.V. Borodin, A.O. Ivanova, M. Montassier, A. Raspaud, (k,1)-coloring of sparse graphs, Manuscript, 2009.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献