The Borodin-Kostochka conjecture for graphs containing a doubly critical edge.
The Electronic Journal of Combinatorics [electronic only] (2007)
- Volume: 14, Issue: 1, page Research Paper N22, 5 p.-Research Paper N22, 5 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topRabern, Landon. "The Borodin-Kostochka conjecture for graphs containing a doubly critical edge.." The Electronic Journal of Combinatorics [electronic only] 14.1 (2007): Research Paper N22, 5 p.-Research Paper N22, 5 p.. <http://eudml.org/doc/129670>.
@article{Rabern2007,
author = {Rabern, Landon},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {double critical edge; lonely path lemma; optimal coloring; vertex disjoint paths},
language = {eng},
number = {1},
pages = {Research Paper N22, 5 p.-Research Paper N22, 5 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The Borodin-Kostochka conjecture for graphs containing a doubly critical edge.},
url = {http://eudml.org/doc/129670},
volume = {14},
year = {2007},
}
TY - JOUR
AU - Rabern, Landon
TI - The Borodin-Kostochka conjecture for graphs containing a doubly critical edge.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2007
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 14
IS - 1
SP - Research Paper N22, 5 p.
EP - Research Paper N22, 5 p.
LA - eng
KW - double critical edge; lonely path lemma; optimal coloring; vertex disjoint paths
UR - http://eudml.org/doc/129670
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.