default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarietjie Frick
Person information
- affiliation: University of South Africa, Pretoria, South Africa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j45]Johan P. de Wet
, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann:
On the Strong Path Partition Conjecture. Discuss. Math. Graph Theory 44(2): 691 (2024)- 2022
- [j44]Johan P. de Wet, Marietjie Frick:
Nested locally Hamiltonian graphs and the Oberly-Sumner Conjecture. Discuss. Math. Graph Theory 42(4): 1281-1312 (2022) - [j43]Alewyn P. Burger, Johan P. de Wet, Marietjie Frick, Nico Van Cleemput, Carol T. Zamfirescu:
Planar hypohamiltonian oriented graphs. J. Graph Theory 100(1): 50-68 (2022) - 2019
- [j42]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Carsten Thomassen, Johan P. de Wet:
Hamilton cycles in sparse locally connected graphs. Discret. Appl. Math. 257: 276-288 (2019) - [j41]Johan P. de Wet, Marietjie Frick:
The Hamilton Cycle Problem for locally traceable and locally hamiltonian graphs. Discret. Appl. Math. 266: 291-308 (2019) - 2018
- [j40]Johan P. de Wet, Marietjie Frick, Susan A. van Aardt:
Hamiltonicity of locally hamiltonian and locally traceable graphs. Discret. Appl. Math. 236: 137-152 (2018) - 2017
- [j39]Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer:
Proper connection and size of graphs. Discret. Math. 340(11): 2673-2677 (2017) - [j38]Susan A. van Aardt, Alewyn Petrus Burger, Marietjie Frick:
The Existence of Planar Hypotraceable Oriented Graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j37]Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet:
On Saito's Conjecture and the Oberly-Sumner Conjectures. Graphs Comb. 33(4): 583-594 (2017) - 2016
- [j36]Susan A. van Aardt, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet:
Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs. Discret. Appl. Math. 205: 171-179 (2016) - 2015
- [j35]Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Nicolas Lichiardopol:
A Linear Bound towards the Traceability Conjecture. Electron. J. Comb. 22(4): 4 (2015) - [j34]Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, Bernardo Llano, Carsten Thomassen, Rita Zuazua:
Destroying longest cycles in graphs and digraphs. Discret. Appl. Math. 186: 251-259 (2015) - [j33]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer:
Hypohamiltonian Oriented Graphs of All Possible Orders. Graphs Comb. 31(6): 1821-1831 (2015) - 2014
- [j32]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Bernardo Llano, Rita Zuazua:
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs. Graphs Comb. 30(4): 783-800 (2014) - 2013
- [j31]Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, John Harris, Joy Singleton:
An Iterative Approach to the Traceability Conjecture for Oriented Graphs. Electron. J. Comb. 20(1): 59 (2013) - [j30]Marietjie Frick:
A survey of the Path Partition Conjecture. Discuss. Math. Graph Theory 33(1): 117-131 (2013) - [j29]Marietjie Frick, Joy Singleton, Susan A. van Aardt:
Independent detour transwersals in 3-deficient digraphs. Discuss. Math. Graph Theory 33(2): 261-275 (2013) - [j28]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick:
An Infinite Family of Planar Hypohamiltonian Oriented Graphs. Graphs Comb. 29(4): 729-733 (2013) - 2011
- [j27]Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt:
Hamiltonicity of k-Traceable Graphs. Electron. J. Comb. 18(1) (2011) - [j26]Susan A. van Aardt, Marietjie Frick, Peter Katrenic, Morten Hegner Nielsen:
The order of hypotraceable oriented graphs. Discret. Math. 311(14): 1273-1280 (2011) - [j25]Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Morten Hegner Nielsen:
Cycles in k-traceable oriented graphs. Discret. Math. 311(18-19): 2085-2094 (2011) - 2010
- [j24]Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Peter Katrenic, Morten Hegner Nielsen, Ortrud R. Oellermann:
Traceability of k-traceable oriented graphs. Discret. Math. 310(8): 1325-1333 (2010) - 2008
- [j23]Frank Bullock, Marietjie Frick, Joy Singleton, Susan A. van Aardt, Christina M. Mynhardt:
Maximal Nontraceable Graphs with Toughness less than One. Electron. J. Comb. 15(1) (2008) - [j22]Marietjie Frick, Susan A. van Aardt, Jean E. Dunbar, Morten Hegner Nielsen, Ortrud R. Oellermann:
A Traceability Conjecture for Oriented Graphs. Electron. J. Comb. 15(1) (2008) - [j21]Marietjie Frick, Peter Katrenic:
Progress on the Traceability Conjecture for Oriented Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - 2007
- [j20]Frank Bullock, Marietjie Frick, Gabriel Semanisin, Róbert Vlacuha:
Nontraceable detour graphs. Discret. Math. 307(7-8): 839-853 (2007) - [j19]Marietjie Frick, Joy Singleton:
Cubic maximal nontraceable graphs. Discret. Math. 307(7-8): 885-891 (2007) - [j18]Frank Bullock, Marietjie Frick, Joy Singleton:
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs. Discret. Math. 307(11-12): 1266-1275 (2007) - [j17]Jean E. Dunbar, Marietjie Frick:
The Path Partition Conjecture is true for claw-free graphs. Discret. Math. 307(11-12): 1285-1290 (2007) - 2005
- [j16]Marietjie Frick, Joy Singleton:
Lower Bound for the Size of Maximal Nontraceable Graphs. Electron. J. Comb. 12 (2005) - [j15]Marietjie Frick, Ingo Schiermeyer:
An Asymptotic Result for the Path Partition Conjecture. Electron. J. Comb. 12 (2005) - [j14]Marietjie Frick, Susan A. van Aardt, Gcina Dlamini, Jean E. Dunbar, Ortrud R. Oellermann:
The directed path partition conjecture. Discuss. Math. Graph Theory 25(3): 331-343 (2005) - [j13]Lowell W. Beineke, Jean E. Dunbar, Marietjie Frick:
Detour-saturated graphs. J. Graph Theory 49(2): 116-134 (2005) - 2004
- [j12]Jean E. Dunbar, Marietjie Frick, Frank Bullock:
Path partitions and Pn-free sets. Discret. Math. 289(1-3): 145-155 (2004) - 2002
- [j11]Jean E. Dunbar, Marietjie Frick, Frank Bullock:
Path Partitions and Pn-free Sets. Electron. Notes Discret. Math. 11: 209-217 (2002) - 2001
- [j10]Frank Bullock, Marietjie Frick:
Detour Chromatic Numbers. Discuss. Math. Graph Theory 21(2): 283-291 (2001) - 1998
- [j9]Izak Broere, Michael Dorfling, Jean E. Dunbar, Marietjie Frick:
A path(ological) partition problem. Discuss. Math. Graph Theory 18(1): 113-125 (1998) - 1997
- [j8]Mieczyslaw Borowiecki, Izak Broere, Marietjie Frick, Peter Mihók, Gabriel Semanisin:
A survey of hereditary properties of graphs. Discuss. Math. Graph Theory 17(1): 5-50 (1997) - [j7]Izak Broere, Marietjie Frick, Gabriel Semanisin:
Maximal graphs with respect to hereditary properties. Discuss. Math. Graph Theory 17(1): 51-66 (1997) - [j6]Jozef Bucko, Marietjie Frick, Peter Mihók, Roman Vasky:
Uniquely partitionable graphs. Discuss. Math. Graph Theory 17(1): 103-113 (1997) - [j5]Izak Broere, Marietjie Frick, Peter Mihók:
The order of uniquely partitionable graphs. Discuss. Math. Graph Theory 17(1): 115-125 (1997) - 1996
- [j4]Gerhard Benadé, Izak Broere, Betsie Jonck, Marietjie Frick:
Uniquely (m, k)tau-colourable graphs and k-tau-saturated graphs. Discret. Math. 162(1-3): 13-22 (1996) - 1994
- [j3]Marietjie Frick, Michael A. Henning:
Extremal results on defective colorings of graphs. Discret. Math. 126(1-3): 151-158 (1994) - 1992
- [j2]Marietjie Frick:
On replete graphs. J. Graph Theory 16(2): 165-175 (1992) - 1990
- [j1]Izak Broere, Marietjie Frick:
On the order of uniquely (k, m)-colourable graphs. Discret. Math. 82(3): 225-232 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
