The game of arboricity
From MaRDI portal
Publication:2476280
DOI10.1016/J.DISC.2007.07.066zbMATH Open1137.05024OpenAlexW2053362603MaRDI QIDQ2476280FDOQ2476280
Authors: J. A. Grytczuk, Tomasz Bartnicki, H. A. Kierstead
Publication date: 18 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.066
Recommendations
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- On acyclic colorings of planar graphs
- Title not available (Why is that?)
- A bound for the game chromatic number of graphs
- The star arboricity of graphs
- Colorings and orientations of graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- The game coloring number of planar graphs
- A simple competitive graph coloring algorithm
- A note on the game chromatic index of graphs
Cited In (13)
- On game chromatic vertex-critical graphs
- Title not available (Why is that?)
- Indicated coloring game on Cartesian products of graphs
- Minimum cost forest games
- Indicated coloring of matroids
- Majority coloring game
- Colouring edges with many colours in cycles
- The tree search game for two players
- The game of arboricity
- On monotonicity in maker-breaker graph colouring games
- Coloring graphs using two colors while avoiding monochromatic cycles
- Trees and Ehrenfeucht-Fraïssé games
- The coloring game on matroids
This page was built for publication: The game of arboricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476280)