Author:
Jin Xian'an,Ma Tianlong,Yang Weiling,Zhang Gang
Reference23 articles.
1. Every planar graph map is four colourable;K Appel;Bull. Amer. Math. Soc,1976
2. On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph;O V Borodin;Diskret. Anal. Issledovanie Oper,2001
3. Planar graphs without cycles of length from 4 to 7 are 3-colorable
4. Fpartitions of sparse graphs;A Brandt;European J. Combin,2016