Game chromatic number of graphs with locally bounded number of cycles
From MaRDI portal
Publication:407532
DOI10.1016/J.IPL.2010.06.004zbMATH Open1234.05090OpenAlexW2013923163MaRDI QIDQ407532FDOQ407532
Authors: Konstanty Junosza-Szaniawski, łukasz Roẓej
Publication date: 27 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.06.004
Recommendations
- A bound for the game chromatic number of graphs
- The game chromatic and chromatic number of some graphs
- Game chromatic number of some network graphs
- scientific article; zbMATH DE number 398953
- scientific article; zbMATH DE number 6843195
- Circular game chromatic number of graphs
- Game chromatic number of outerplanar graphs
- scientific article
- The game chromatic number of some join graphs
- Game chromatic index of graphs with given restrictions on degrees
Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- The Map-Coloring Game
- The game chromatic number and the game colouring number of cactuses
- ON THE COMPLEXITY OF SOME COLORING GAMES
- A simple competitive graph coloring algorithm
- Refined activation strategy for the marking game
- Decomposition of sparse graphs, with application to game coloring number
Cited In (5)
This page was built for publication: Game chromatic number of graphs with locally bounded number of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407532)