### Abstract

We investigate a competitive version of the coloring number of a graph G = (V, E). For a fixed linear ordering L of V let s (L) be one more than the maximum outdegree of G when G is oriented so that x ← y if x < _{L} y. The coloring number of G is the minimum of s (L) over all such orderings. The (a, b)-marking game is played on a graph G = (V, E) as follows. At the start all vertices are unmarked. The players, Alice and Bob, take turns playing. A play consists of Alice marking a unmarked vertices or Bob marking b unmarked vertices. The game ends when there are no remaining unmarked vertices. Together the players create a linear ordering L of V defined by x < y if x is marked before y. The score of the game is s (L). The (a, b)-game coloring number of G is the minimum score that Alice can obtain regardless of Bob's strategy. The usual (1, 1)-marking game is well studied and there are many interesting results. Our main result is that if G has an orientation with maximum outdegree k then the (k, 1)-game coloring number of G is at most 2k + 2. This extends a fundamental result on the (1, 1)-game coloring number of trees. We also construct examples to show that this bound is tight for many classes of graphs. Finally we prove bounds on the (a, 1)-game coloring number when a < k.

Original language | English (US) |
---|---|

Pages (from-to) | 93-107 |

Number of pages | 15 |

Journal | Order |

Volume | 22 |

Issue number | 2 |

DOIs | |

State | Published - May 2005 |

### Fingerprint

### Keywords

- Coloring number
- Competitive coloring
- Planar graph

### ASJC Scopus subject areas

- Algebra and Number Theory

### Cite this

*Order*,

*22*(2), 93-107. https://doi.org/10.1007/s11083-005-9012-y

**Very asymmetric marking games.** / Kierstead, Henry; Yang, Daqing.

Research output: Contribution to journal › Article

*Order*, vol. 22, no. 2, pp. 93-107. https://doi.org/10.1007/s11083-005-9012-y

}

TY - JOUR

T1 - Very asymmetric marking games

AU - Kierstead, Henry

AU - Yang, Daqing

PY - 2005/5

Y1 - 2005/5

N2 - We investigate a competitive version of the coloring number of a graph G = (V, E). For a fixed linear ordering L of V let s (L) be one more than the maximum outdegree of G when G is oriented so that x ← y if x < L y. The coloring number of G is the minimum of s (L) over all such orderings. The (a, b)-marking game is played on a graph G = (V, E) as follows. At the start all vertices are unmarked. The players, Alice and Bob, take turns playing. A play consists of Alice marking a unmarked vertices or Bob marking b unmarked vertices. The game ends when there are no remaining unmarked vertices. Together the players create a linear ordering L of V defined by x < y if x is marked before y. The score of the game is s (L). The (a, b)-game coloring number of G is the minimum score that Alice can obtain regardless of Bob's strategy. The usual (1, 1)-marking game is well studied and there are many interesting results. Our main result is that if G has an orientation with maximum outdegree k then the (k, 1)-game coloring number of G is at most 2k + 2. This extends a fundamental result on the (1, 1)-game coloring number of trees. We also construct examples to show that this bound is tight for many classes of graphs. Finally we prove bounds on the (a, 1)-game coloring number when a < k.

AB - We investigate a competitive version of the coloring number of a graph G = (V, E). For a fixed linear ordering L of V let s (L) be one more than the maximum outdegree of G when G is oriented so that x ← y if x < L y. The coloring number of G is the minimum of s (L) over all such orderings. The (a, b)-marking game is played on a graph G = (V, E) as follows. At the start all vertices are unmarked. The players, Alice and Bob, take turns playing. A play consists of Alice marking a unmarked vertices or Bob marking b unmarked vertices. The game ends when there are no remaining unmarked vertices. Together the players create a linear ordering L of V defined by x < y if x is marked before y. The score of the game is s (L). The (a, b)-game coloring number of G is the minimum score that Alice can obtain regardless of Bob's strategy. The usual (1, 1)-marking game is well studied and there are many interesting results. Our main result is that if G has an orientation with maximum outdegree k then the (k, 1)-game coloring number of G is at most 2k + 2. This extends a fundamental result on the (1, 1)-game coloring number of trees. We also construct examples to show that this bound is tight for many classes of graphs. Finally we prove bounds on the (a, 1)-game coloring number when a < k.

KW - Coloring number

KW - Competitive coloring

KW - Planar graph

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

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

U2 - 10.1007/s11083-005-9012-y

DO - 10.1007/s11083-005-9012-y

M3 - Article

AN - SCOPUS:32544433902

VL - 22

SP - 93

EP - 107

JO - Order

JF - Order

SN - 0167-8094

IS - 2

ER -