Two extremal problems in graph theory.
Brualdi, Richard A.; Mellendorf, Stephen
The Electronic Journal of Combinatorics [electronic only] (1994)
- Volume: 1
- ISSN: 1077-8926
Access Full Article
top
How to cite
topBrualdi, Richard A., and Mellendorf, Stephen. "Two extremal problems in graph theory.." The Electronic Journal of Combinatorics [electronic only] 1 (1994): . <http://eudml.org/doc/118558>.
@article{Brualdi1994,
author = {Brualdi, Richard A., Mellendorf, Stephen},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {extremal problems; maximum number of edges},
language = {eng},
pages = {},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Two extremal problems in graph theory.},
url = {http://eudml.org/doc/118558},
volume = {1},
year = {1994},
}
TY - JOUR
AU - Brualdi, Richard A.
AU - Mellendorf, Stephen
TI - Two extremal problems in graph theory.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1994
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 1
SP -
LA - eng
KW - extremal problems; maximum number of edges
UR - http://eudml.org/doc/118558
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.