68 research outputs found
Asymmetric coloring games on incomparability graphs
Consider the following game on a graph : Alice and Bob take turns coloring
the vertices of properly from a fixed set of colors; Alice wins when the
entire graph has been colored, while Bob wins when some uncolored vertices have
been left. The game chromatic number of is the minimum number of colors
that allows Alice to win the game. The game Grundy number of is defined
similarly except that the players color the vertices according to the first-fit
rule and they only decide on the order in which it is applied. The -game
chromatic and Grundy numbers are defined likewise except that Alice colors
vertices and Bob colors vertices in each round. We study the behavior of
these parameters for incomparability graphs of posets with bounded width. We
conjecture a complete characterization of the pairs for which the
-game chromatic and Grundy numbers are bounded in terms of the width of
the poset; we prove that it gives a necessary condition and provide some
evidence for its sufficiency. We also show that the game chromatic number is
not bounded in terms of the Grundy number, which answers a question of Havet
and Zhu
A Connected Version of the Graph Coloring Game
The graph coloring game is a two-player game in which, given a graph G and a set of k colors, the two players, Alice and Bob, take turns coloring properly an uncolored vertex of G, Alice having the first move. Alice wins the game if and only if all the vertices of G are eventually colored. The game chromatic number of a graph G is then defined as the smallest integer k for which Alice has a winning strategy when playing the graph coloring game on G with k colors. In this paper, we introduce and study a new version of the graph coloring game by requiring that, after each player's turn, the subgraph induced by the set of colored vertices is connected. The connected game chromatic number of a graph G is then the smallest integer k for which Alice has a winning strategy when playing the connected graph coloring game on G with k colors. We prove that the connected game chromatic number of every outerplanar graph is at most 5 and that there exist outerplanar graphs with connected game chromatic number 4. Moreover, we prove that for every integer k ≥ 3, there exist bipartite graphs on which Bob wins the connected coloring game with k colors, while Alice wins the connected coloring game with two colors on every bipartite graph
Chromatic numbers of exact distance graphs
For any graph G = (V;E) and positive integer p, the exact distance-p graph G[\p] is the graph with vertex set V , which has an edge between vertices x and y if and only if x and y have distance p in G. For odd p, Nešetřil and Ossona de Mendez proved that for any fixed graph class with bounded expansion, the chromatic number of G[\p] is bounded by an absolute constant. Using the notion of generalised colouring numbers, we give a much simpler proof for the result of Nešetřil and Ossona de Mendez, which at the same time gives significantly better bounds. In particular, we show that for any graph G and odd positive integer p, the chromatic number of G[\p] is bounded by the weak (2
Characterising and recognising game-perfect graphs
Consider a vertex colouring game played on a simple graph with
permissible colours. Two players, a maker and a breaker, take turns to colour
an uncoloured vertex such that adjacent vertices receive different colours. The
game ends once the graph is fully coloured, in which case the maker wins, or
the graph can no longer be fully coloured, in which case the breaker wins. In
the game , the breaker makes the first move. Our main focus is on the
class of -perfect graphs: graphs such that for every induced subgraph ,
the game played on admits a winning strategy for the maker with only
colours, where denotes the clique number of .
Complementing analogous results for other variations of the game, we
characterise -perfect graphs in two ways, by forbidden induced subgraphs
and by explicit structural descriptions. We also present a clique module
decomposition, which may be of independent interest, that allows us to
efficiently recognise -perfect graphs.Comment: 39 pages, 8 figures. An extended abstract was accepted at the
International Colloquium on Graph Theory (ICGT) 201
Improved bounds for weak coloring numbers
Weak coloring numbers generalize the notion of degeneracy of a graph. They were introduced by Kierstead & Yang in the context of games on graphs. Recently, several connections have been uncovered between weak coloring numbers and various parameters studied in graph minor theory and its generalizations. In this note, we show that for every fixed , the maximum r-th weak coloring number of a graph with simple treewidth is . As a corollary, we improve the lower bound on the maximum r-th weak coloring number of planar graphs from to , and we obtain a tight bound of (r log r) for outerplanar graphs
Improved bounds for weak coloring numbers
Weak coloring numbers generalize the notion of degeneracy of a graph. They
were introduced by Kierstead \& Yang in the context of games on graphs.
Recently, several connections have been uncovered between weak coloring numbers
and various parameters studied in graph minor theory and its generalizations.
In this note, we show that for every fixed , the maximum -th weak
coloring number of a graph with simple treewidth is . As a corollary, we improve the lower bound on the maximum -th weak
coloring number of planar graphs from to , and
we obtain a tight bound of for outerplanar graphs.Comment: v2: minor changes (in particular, open problem 3 in v1 has already
been solved
- …