Dense -free graphs are almost -partite.
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper R21, 11 p.-Research Paper R21, 11 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topAllen, Peter. "Dense -free graphs are almost -partite.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper R21, 11 p.-Research Paper R21, 11 p.. <http://eudml.org/doc/229553>.
@article{Allen2010,
author = {Allen, Peter},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper R21, 11 p.-Research Paper R21, 11 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Dense -free graphs are almost -partite.},
url = {http://eudml.org/doc/229553},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Allen, Peter
TI - Dense -free graphs are almost -partite.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2010
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 17
IS - 1
SP - Research Paper R21, 11 p.
EP - Research Paper R21, 11 p.
LA - eng
UR - http://eudml.org/doc/229553
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.