Author:
Borodin O.V.,Kostochka A.V.
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 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 list vertex 2-colorings of sparse graphs;Borodin;Diskretn. Anal. Issled. Oper.,2009
4. Vertex partitions of sparse graphs into an independent vertex set and subgraph of maximum degree at most one;Borodin;Sibirsk. Mat. Zh.,2011
5. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k;Borodin;J. Graph Theory,2010
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献