1. Nonhamiltonian 3-connected cubic planar graphs;Aldred;SIAM J. Discrete Math.,2000
2. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976
3. On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph;Borodin;Diskretn. Anal. Issled. Oper. Ser.1,2001
4. J. Bosák, Hamiltonian lines in cubic graphs, Presented at the International Seminar on Graph Theory and its Applications, Rome 5–9, 1966
5. An inequality involving the vertex arboricity and the edge arborocity of a graph;Burr;J. Graph Theory,1986