Orderings on graphs and game coloring number

Henry Kierstead, Daqing Yang

Research output: Contribution to journalArticle

44 Citations (Scopus)

Abstract

Many graph theoretic algorithms rely on an initial ordering of the vertices of the graph which has some special properties. We discuss new ways to measure the quality of such orders, give methods for constructing high quality orders, and provide applications for these orders. While our main motivation is the study of game chromatic number, there have been other applications of these ideas and we expect there will be more.

Original languageEnglish (US)
Pages (from-to)255-264
Number of pages10
JournalOrder
Volume20
Issue number3
DOIs
StatePublished - 2003

Fingerprint

Game Coloring number
Coloring
Graph in graph theory
Game Chromatic number

Keywords

  • K-coloring number
  • K-game coloring number
  • Planar graphs

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

Orderings on graphs and game coloring number. / Kierstead, Henry; Yang, Daqing.

In: Order, Vol. 20, No. 3, 2003, p. 255-264.

Research output: Contribution to journalArticle

Kierstead, Henry ; Yang, Daqing. / Orderings on graphs and game coloring number. In: Order. 2003 ; Vol. 20, No. 3. pp. 255-264.
@article{6c95bba5dec241849c3cad5e458a244d,
title = "Orderings on graphs and game coloring number",
abstract = "Many graph theoretic algorithms rely on an initial ordering of the vertices of the graph which has some special properties. We discuss new ways to measure the quality of such orders, give methods for constructing high quality orders, and provide applications for these orders. While our main motivation is the study of game chromatic number, there have been other applications of these ideas and we expect there will be more.",
keywords = "K-coloring number, K-game coloring number, Planar graphs",
author = "Henry Kierstead and Daqing Yang",
year = "2003",
doi = "10.1023/B:ORDE.0000026489.93166.cb",
language = "English (US)",
volume = "20",
pages = "255--264",
journal = "Order",
issn = "0167-8094",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Orderings on graphs and game coloring number

AU - Kierstead, Henry

AU - Yang, Daqing

PY - 2003

Y1 - 2003

N2 - Many graph theoretic algorithms rely on an initial ordering of the vertices of the graph which has some special properties. We discuss new ways to measure the quality of such orders, give methods for constructing high quality orders, and provide applications for these orders. While our main motivation is the study of game chromatic number, there have been other applications of these ideas and we expect there will be more.

AB - Many graph theoretic algorithms rely on an initial ordering of the vertices of the graph which has some special properties. We discuss new ways to measure the quality of such orders, give methods for constructing high quality orders, and provide applications for these orders. While our main motivation is the study of game chromatic number, there have been other applications of these ideas and we expect there will be more.

KW - K-coloring number

KW - K-game coloring number

KW - Planar graphs

UR - http://www.scopus.com/inward/record.url?scp=3543022760&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3543022760&partnerID=8YFLogxK

U2 - 10.1023/B:ORDE.0000026489.93166.cb

DO - 10.1023/B:ORDE.0000026489.93166.cb

M3 - Article

VL - 20

SP - 255

EP - 264

JO - Order

JF - Order

SN - 0167-8094

IS - 3

ER -