-free graphs of large minimum degree.
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper R19, 9 p.-Research paper R19, 9 p.
- ISSN: 1077-8926
Access Full Article
topHow to cite
topAlon, Noga, and Sudakov, Benny. "-free graphs of large minimum degree.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper R19, 9 p.-Research paper R19, 9 p.. <http://eudml.org/doc/125852>.
@article{Alon2006,
author = {Alon, Noga, Sudakov, Benny},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {chromatic number},
language = {eng},
number = {1},
pages = {Research paper R19, 9 p.-Research paper R19, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {-free graphs of large minimum degree.},
url = {http://eudml.org/doc/125852},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Alon, Noga
AU - Sudakov, Benny
TI - -free graphs of large minimum degree.
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 R19, 9 p.
EP - Research paper R19, 9 p.
LA - eng
KW - chromatic number
UR - http://eudml.org/doc/125852
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.