Results 1 
4 of
4
Construction of planar triangulations with minimum degree 5
, 1969
"... In this article we describe a method of constructing all simple triangulations of the sphere with minimum degree 5; equivalently, 3connected planar cubic graphs with girth 5. We also present the results of a computer program based on this algorithm, including counts of convex polytopes of minimum d ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this article we describe a method of constructing all simple triangulations of the sphere with minimum degree 5; equivalently, 3connected planar cubic graphs with girth 5. We also present the results of a computer program based on this algorithm, including counts of convex polytopes of minimum degree 5. Key words: planar triangulation, cubic graph, generation, fullerene
Lineartime algorithms to color topological graphs
, 2005
"... We describe a lineartime algorithm for 4coloring planar graphs. We indeed give an O(V + E + χ  + 1)time algorithm to Ccolor Vvertex Eedge graphs embeddable on a 2manifold M of Euler characteristic χ where C(M) is given by Heawood’s (minimax optimal) formula. Also we show how, in O(V + E) ..."
Abstract
 Add to MetaCart
We describe a lineartime algorithm for 4coloring planar graphs. We indeed give an O(V + E + χ  + 1)time algorithm to Ccolor Vvertex Eedge graphs embeddable on a 2manifold M of Euler characteristic χ where C(M) is given by Heawood’s (minimax optimal) formula. Also we show how, in O(V + E) time, to find the exact chromatic number of a maximal planar graph (one with E = 3V − 6) and a coloring achieving it. Finally, there is a lineartime algorithm to 5color a graph embedded on any fixed surface M except that an Mdependent constant number of vertices are left uncolored. All the algorithms are simple and practical and run on a deterministic pointer machine, except for planar graph 4coloring which involves enormous constant factors and requires an integer RAM with a random number generator. All of the algorithms mentioned so far are in the ultraparallelizable deterministic computational complexity class “NC. ” We also have more practical planar 4coloring algorithms that can run on pointer machines in O(V log V) randomized time and O(V) space, and a very simple deterministic O(V)time coloring algorithm for planar graphs which conjecturally uses 4 colors.
Planar Graphs, Regular Graphs, Bipartite Graphs and Hamiltonicity by
"... This paper seeks to review some ideas and results relating to Hamiltonian graphs. We list the well known results which are to be found in most undergraduate graph theory courses and then consider some old theorems which are fundamental to planar graphs. By restricting our attention to 3connected cu ..."
Abstract
 Add to MetaCart
This paper seeks to review some ideas and results relating to Hamiltonian graphs. We list the well known results which are to be found in most undergraduate graph theory courses and then consider some old theorems which are fundamental to planar graphs. By restricting our attention to 3connected cubic planar graphs (a class of graphs of interest to Four Colour Theorists), we are able to report on recent results regarding the smallest non Hamiltonian graphs. We then consider regular graphs generally and what might be said about when the number of Hamiltonian cycles is greater than one. Another interesting class of graphs are the bipartite graphs. In general these are not Hamiltonian but there is a famous conjecture due to Barnette that suggests that 3connected cubic bipartite planar graphs are Hamiltonian. In our final two sections we consider this along with another open conjecture due to Barnette. 1