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 | |
State | Published - Dec 1 2003 |
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