Game chromatic number of graphs with locally bounded number of cycles (Q407532): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Map-Coloring Game / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON THE COMPLEXITY OF SOME COLORING GAMES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4201568 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple competitive graph coloring algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of sparse graphs, with application to game coloring number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The game chromatic number and the game colouring number of cactuses / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Refined activation strategy for the marking game / rank | |||
Normal rank |
Latest revision as of 00:17, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Game chromatic number of graphs with locally bounded number of cycles |
scientific article |
Statements
Game chromatic number of graphs with locally bounded number of cycles (English)
0 references
27 March 2012
0 references
combinatorial problems
0 references
competitive algorithms
0 references
game coloring number
0 references
game chromatic number
0 references