Competitive colorings of oriented graphs.
Kierstead, H.A.; Trotter, W.T.
The Electronic Journal of Combinatorics [electronic only] (2001)
- Volume: 8, Issue: 2, page Research paper R12, 15 p.-Research paper R12, 15 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKierstead, H.A., and Trotter, W.T.. "Competitive colorings of oriented graphs.." The Electronic Journal of Combinatorics [electronic only] 8.2 (2001): Research paper R12, 15 p.-Research paper R12, 15 p.. <http://eudml.org/doc/121760>.
@article{Kierstead2001,
author = {Kierstead, H.A., Trotter, W.T.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {competive algorithm; graph coloring; game chromatic number; oriented graph},
language = {eng},
number = {2},
pages = {Research paper R12, 15 p.-Research paper R12, 15 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Competitive colorings of oriented graphs.},
url = {http://eudml.org/doc/121760},
volume = {8},
year = {2001},
}
TY - JOUR
AU - Kierstead, H.A.
AU - Trotter, W.T.
TI - Competitive colorings of oriented graphs.
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 - 2
SP - Research paper R12, 15 p.
EP - Research paper R12, 15 p.
LA - eng
KW - competive algorithm; graph coloring; game chromatic number; oriented graph
UR - http://eudml.org/doc/121760
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.