Orderings on graphs and game coloring number

Henry Kierstead, Daqing Yang

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)255-264
Number of pages10
JournalOrder
Volume20
Issue number3
DOIs
StatePublished - 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