 | 2008 |
| 13 |  | Marietjie Frick,
Peter Katrenic:
Progress on the Traceability Conjecture for Oriented Graphs.
Discrete Mathematics & Theoretical Computer Science 10(3): (2008) |
| 2007 |
| 12 |  | Frank Bullock,
Marietjie Frick,
Joy Singleton:
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs.
Discrete Mathematics 307(11-12): 1266-1275 (2007) |
| 11 |  | Jean E. Dunbar,
Marietjie Frick:
The Path Partition Conjecture is true for claw-free graphs.
Discrete Mathematics 307(11-12): 1285-1290 (2007) |
| 10 |  | Frank Bullock,
Marietjie Frick,
Gabriel Semanisin,
Róbert Vlacuha:
Nontraceable detour graphs.
Discrete Mathematics 307(7-8): 839-853 (2007) |
| 9 |  | Marietjie Frick,
Joy Singleton:
Cubic maximal nontraceable graphs.
Discrete Mathematics 307(7-8): 885-891 (2007) |
| 2005 |
| 8 |  | Marietjie Frick,
Ingo Schiermeyer:
An Asymptotic Result for the Path Partition Conjecture.
Electr. J. Comb. 12: (2005) |
| 7 |  | Marietjie Frick,
Joy Singleton:
Lower Bound for the Size of Maximal Nontraceable Graphs.
Electr. J. Comb. 12: (2005) |
| 6 |  | Lowell W. Beineke,
Jean E. Dunbar,
Marietjie Frick:
Detour-saturated graphs.
Journal of Graph Theory 49(2): 116-134 (2005) |
| 2004 |
| 5 |  | Jean E. Dunbar,
Marietjie Frick,
Frank Bullock:
Path partitions and Pn-free sets.
Discrete Mathematics 289(1-3): 145-155 (2004) |
| 2002 |
| 4 |  | Jean E. Dunbar,
Marietjie Frick,
Frank Bullock:
Path Partitions and Pn-free Sets.
Electronic Notes in Discrete Mathematics 11: 209-217 (2002) |
| 1996 |
| 3 |  | Gerhard Benadé,
Izak Broere,
Betsie Jonck,
Marietjie Frick:
Uniquely (m, k)tau-colourable graphs and k-tau-saturated graphs.
Discrete Mathematics 162(1-3): 13-22 (1996) |
| 1994 |
| 2 |  | Marietjie Frick,
Michael A. Henning:
Extremal results on defective colorings of graphs.
Discrete Mathematics 126(1-3): 151-158 (1994) |
| 1990 |
| 1 |  | Izak Broere,
Marietjie Frick:
On the order of uniquely (k, m)-colourable graphs.
Discrete Mathematics 82(3): 225-232 (1990) |