The orthogonal colouring game

DOI10.1016/j.tcs.2019.07.014zbMath1433.05224OpenAlexW2912715979WikidataQ127456183 ScholiaQ127456183MaRDI QIDQ2330119

Richard J. Nowakowski, Melissa Huggan, Stephan Dominique Andres, Fionn Mc Inerney

Publication date: 18 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02017462/file/Corrected_TCS_orthogonalGraphColoringGame.pdf

zbMATH Keywords

mutually orthogonal Latin squaresgames on graphsscoring gameorthogonal colouring gameorthogonal graph colouringstrictly matched involution

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Smash and grab: the \(0 \cdot 6\) scoring game on graphs ⋮ Bipartite instances of INFLUENCE ⋮ The complexity of two colouring games ⋮ Corrigendum to: ``The orthogonal colouring game ⋮ The largest connected subgraph game ⋮ The largest connected subgraph game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Guaranteed scoring games
• Impartial coloring games
• Upper bounds on sets of orthogonal colorings of graphs
• Orthogonal colorings of graphs
• Game comparison through play
• Games with guaranteed scores and waiting moves
• Simplicial complexes are game complexes
• Refined activation strategy for the marking game
• Competition parameters of a graph
• Progress towards the total domination game \(\frac{3}{4}\)-conjecture
• Two graph-colouring games
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• The Map-Coloring Game

This page was built for publication: The orthogonal colouring game