Orderings on Graphs and Game Coloring Number

Authors: Kierstead H.A.; Yang D.

Source: Order, Volume 20, Number 3, 2003 , pp. 255-264(10)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

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

Document Type: Research article

DOI: http://dx.doi.org/10.1023/B:ORDE.0000026489.93166.cb

Affiliations: 1: Department of Mathematics and Statistics, Arizona State University, Tempe, AZ 85287-1804, USA

Publication date: 2003-01-01