Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie; Singleton, Joy
The Electronic Journal of Combinatorics [electronic only] (2005)
- Volume: 12, Issue: 1, page Research Paper 32, 9 p., electronic only-Research Paper 32, 9 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topFrick, Marietjie, and Singleton, Joy. "Lower bound for the size of maximal nontraceable graphs.." The Electronic Journal of Combinatorics [electronic only] 12.1 (2005): Research Paper 32, 9 p., electronic only-Research Paper 32, 9 p., electronic only. <http://eudml.org/doc/125215>.
@article{Frick2005,
author = {Frick, Marietjie, Singleton, Joy},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Hamiltonian path; traceable},
language = {eng},
number = {1},
pages = {Research Paper 32, 9 p., electronic only-Research Paper 32, 9 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Lower bound for the size of maximal nontraceable graphs.},
url = {http://eudml.org/doc/125215},
volume = {12},
year = {2005},
}
TY - JOUR
AU - Frick, Marietjie
AU - Singleton, Joy
TI - Lower bound for the size of maximal nontraceable graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2005
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 12
IS - 1
SP - Research Paper 32, 9 p., electronic only
EP - Research Paper 32, 9 p., electronic only
LA - eng
KW - Hamiltonian path; traceable
UR - http://eudml.org/doc/125215
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.