Constructive upper bounds for cycle-saturated graphs of minimum size.
Gould, Ronald; Łuczak, Tomasz; Schmitt, John
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper R29, 19 p.-Research paper R29, 19 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGould, Ronald, Łuczak, Tomasz, and Schmitt, John. "Constructive upper bounds for cycle-saturated graphs of minimum size.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper R29, 19 p.-Research paper R29, 19 p.. <http://eudml.org/doc/126586>.
@article{Gould2006,
author = {Gould, Ronald, Łuczak, Tomasz, Schmitt, John},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {conjecture of Bollobás},
language = {eng},
number = {1},
pages = {Research paper R29, 19 p.-Research paper R29, 19 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Constructive upper bounds for cycle-saturated graphs of minimum size.},
url = {http://eudml.org/doc/126586},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Gould, Ronald
AU - Łuczak, Tomasz
AU - Schmitt, John
TI - Constructive upper bounds for cycle-saturated graphs of minimum size.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2006
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 13
IS - 1
SP - Research paper R29, 19 p.
EP - Research paper R29, 19 p.
LA - eng
KW - conjecture of Bollobás
UR - http://eudml.org/doc/126586
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.