Frank Bullock

According to our database, Frank Bullock authored at least 8 papers between 2001 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2011

Hamiltonicity of <i>k</i>-Traceable Graphs.

Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt

Electron. J. Comb., 2011

2009

On detour homogeneous digraphs.

Susan A. van Aardt, Frank Bullock, Joanna Górska, Zdzislaw Skupien

Discret. Math., 2009

2008

Maximal Nontraceable Graphs with Toughness less than One.

Frank Bullock, Marietjie Frick, Joy Singleton, Susan A. van Aardt, Christina M. Mynhardt

Electron. J. Comb., 2008

2007

Nontraceable detour graphs.

Frank Bullock, Marietjie Frick, Gabriel Semanisin, Róbert Vlacuha

Discret. Math., 2007

Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs.

Frank Bullock, Marietjie Frick, Joy Singleton

Discret. Math., 2007

2004

Path partitions and <i>P_n</i>-free sets.

Jean E. Dunbar, Marietjie Frick, Frank Bullock

Discret. Math., 2004

2002

Path Partitions and P_n-free Sets.

Jean E. Dunbar, Marietjie Frick, Frank Bullock

Electron. Notes Discret. Math., 2002

2001

Detour Chromatic Numbers.

Frank Bullock, Marietjie Frick

Discuss. Math. Graph Theory, 2001