Author:
Wigal Michael C.,Yu Xingxing
Funder
National Science Foundation
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Every planar map is four colorable. I. Discharging;Appel;Ill. J. Math.,1977
2. Every planar map is four colorable. II. Reducibility;Appel;Ill. J. Math.,1977
3. Long cycles in graphs on a fixed surface;Böhme;J. Comb. Theory, Ser. B,2002
4. The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices;Holton;J. Comb. Theory, Ser. B,1988
5. Long cycles in 3-connected graphs;Chen;J. Comb. Theory, Ser. B,2002