Graph minors and minimum degree.
Fijavž, Gašper; Wood, David R.
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper R151, 30 p., electronic only-Research Paper R151, 30 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topFijavž, Gašper, and Wood, David R.. "Graph minors and minimum degree.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper R151, 30 p., electronic only-Research Paper R151, 30 p., electronic only. <http://eudml.org/doc/224228>.
@article{Fijavž2010,
author = {Fijavž, Gašper, Wood, David R.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {graph minor; minimum degree; Robertson-Seymour graph minor theorem},
language = {eng},
number = {1},
pages = {Research Paper R151, 30 p., electronic only-Research Paper R151, 30 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Graph minors and minimum degree.},
url = {http://eudml.org/doc/224228},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Fijavž, Gašper
AU - Wood, David R.
TI - Graph minors and minimum degree.
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 R151, 30 p., electronic only
EP - Research Paper R151, 30 p., electronic only
LA - eng
KW - graph minor; minimum degree; Robertson-Seymour graph minor theorem
UR - http://eudml.org/doc/224228
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.