How to find overfull subgraphs in graphs with large maximum degree. II.
The Electronic Journal of Combinatorics [electronic only] (2001)
- Volume: 8, Issue: 1, page Research paper R7, 11 p.-Research paper R7, 11 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topNiessen, Thomas. "How to find overfull subgraphs in graphs with large maximum degree. II.." The Electronic Journal of Combinatorics [electronic only] 8.1 (2001): Research paper R7, 11 p.-Research paper R7, 11 p.. <http://eudml.org/doc/121258>.
@article{Niessen2001,
author = {Niessen, Thomas},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {chromatic index; maximum degree; overfull graph; algorithm; regular graphs},
language = {eng},
number = {1},
pages = {Research paper R7, 11 p.-Research paper R7, 11 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {How to find overfull subgraphs in graphs with large maximum degree. II.},
url = {http://eudml.org/doc/121258},
volume = {8},
year = {2001},
}
TY - JOUR
AU - Niessen, Thomas
TI - How to find overfull subgraphs in graphs with large maximum degree. II.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2001
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 8
IS - 1
SP - Research paper R7, 11 p.
EP - Research paper R7, 11 p.
LA - eng
KW - chromatic index; maximum degree; overfull graph; algorithm; regular graphs
UR - http://eudml.org/doc/121258
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.