On extremal graphs with no long paths.
Ali, Asad Ali; Staton, William
The Electronic Journal of Combinatorics [electronic only] (1996)
- Volume: 3, Issue: 1, page Research paper R20, 4 p.-Research paper R20, 4 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topAli, Asad Ali, and Staton, William. "On extremal graphs with no long paths.." The Electronic Journal of Combinatorics [electronic only] 3.1 (1996): Research paper R20, 4 p.-Research paper R20, 4 p.. <http://eudml.org/doc/119217>.
@article{Ali1996,
author = {Ali, Asad Ali, Staton, William},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {extremal graphs; paths; characterization},
language = {eng},
number = {1},
pages = {Research paper R20, 4 p.-Research paper R20, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {On extremal graphs with no long paths.},
url = {http://eudml.org/doc/119217},
volume = {3},
year = {1996},
}
TY - JOUR
AU - Ali, Asad Ali
AU - Staton, William
TI - On extremal graphs with no long paths.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1996
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 3
IS - 1
SP - Research paper R20, 4 p.
EP - Research paper R20, 4 p.
LA - eng
KW - extremal graphs; paths; characterization
UR - http://eudml.org/doc/119217
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.