2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2004
Lower bound for the size of maximal nontraceable graphs
Marietjie Frick, Joy Singleton
Let g(n) denote the minimum number of edges of a maximal nontraceable graph of order n. Dudek, Katona and Wojda (2003) showed that g(n)\geq\ceil{(3n-2)/2}-2 for n\geq 20 and g(n)\l…
math.CO2004★ 2 cited
Cubic maximal nontraceable graphs
Marietjie Frick, Joy Singleton
We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that…