Orderings on graphs and game coloring number

Henry Kierstead; Daqing Yang

doi:10.1023/B:ORDE.0000026489.93166.cb

Orderings on graphs and game coloring number

Henry Kierstead, Daqing Yang

CLAS-NS: Mathematics and Statistical Sciences, School of (SMSS)

Research output: Contribution to journal › Article

49 Scopus citations

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 language	English (US)
Pages (from-to)	255-264
Number of pages	10
Journal	Order
Volume	20
Issue number	3
DOIs	https://doi.org/10.1023/B:ORDE.0000026489.93166.cb
State	Published - Dec 1 2003

Fingerprint

Keywords

K-coloring number
K-game coloring number
Planar graphs

ASJC Scopus subject areas

Algebra and Number Theory
Geometry and Topology
Computational Theory and Mathematics

Cite this

Kierstead, H., & Yang, D. (2003). Orderings on graphs and game coloring number. Order, 20(3), 255-264. https://doi.org/10.1023/B:ORDE.0000026489.93166.cb

@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",

month = dec,

day = "1",

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/12/1

Y1 - 2003/12/1

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

AN - SCOPUS:3543022760

VL - 20

SP - 255

EP - 264

JO - Order

JF - Order

SN - 0167-8094

IS - 3

ER -

Access to Document

10.1023/B:ORDE.0000026489.93166.cb