The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marietjie Frick: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean E. Dunbar, Marietjie Frick, Frank Bullock
    Path partitions and Pn-free sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:145-155 [Journal]
  2. Frank Bullock, Marietjie Frick, Gabriel Semanisin, Róbert Vlacuha
    Nontraceable detour graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:839-853 [Journal]
  3. Marietjie Frick, Joy Singleton
    Cubic maximal nontraceable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:885-891 [Journal]
  4. Jean E. Dunbar, Marietjie Frick
    The Path Partition Conjecture is true for claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1285-1290 [Journal]
  5. Frank Bullock, Marietjie Frick, Joy Singleton
    Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1266-1275 [Journal]
  6. Lowell W. Beineke, Jean E. Dunbar, Marietjie Frick
    Detour-saturated graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:2, pp:116-134 [Journal]
  7. Gerhard Benadé, Izak Broere, Betsie Jonck, Marietjie Frick
    Uniquely (m, k)tau-colourable graphs and k-tau-saturated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:13-22 [Journal]
  8. Izak Broere, Marietjie Frick
    On the order of uniquely (k, m)-colourable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:225-232 [Journal]
  9. Marietjie Frick, Michael A. Henning
    Extremal results on defective colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:151-158 [Journal]

  10. An Asymptotic Result for the Path Partition Conjecture. [Citation Graph (, )][DBLP]


  11. Lower Bound for the Size of Maximal Nontraceable Graphs. [Citation Graph (, )][DBLP]


  12. Traceability of k-traceable oriented graphs. [Citation Graph (, )][DBLP]


  13. Progress on the Traceability Conjecture for Oriented Graphs. [Citation Graph (, )][DBLP]


Search in 0.053secs, Finished in 0.053secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002