4 citations · 5 across the 4 of their papers we have counts for
5 papers
Line game-perfect graphs
Stephan Dominique Andres, Wai Lam Fong
The -edge colouring game is played with a set of colours on a graph with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternate…
A Semi-strong Perfect Digraph Theorem
Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler +1
Reed showed that, if two graphs are -isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.
Characterising and recognising game-perfect graphs
Dominique Andres, Edwin Lock
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 adja…
Colouring games based on autotopisms of Latin hyper-rectangles
Stephan Dominique Andres, Raúl M. Falcón
Every partial colouring of a Hamming graph is uniquely related to a partial Latin hyper-rectangle. In this paper we introduce the -stabilized -colouring game for Hamming…
The game colouring number of powers of forests
Stephan Dominique Andres, Winfried Hochstättler
We prove that the game colouring number of the -th power of a forest of maximum degree is bounded from above by \[\frac{(Δ-1)^m-1}{Δ-2}+2^m+1,\] which improves the best…