The connected greedy coloring game (Q2699943): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterising and recognising game-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard-to-color graphs for connected sequential colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game chromatic number of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Greedy Colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with restricted bicolored subgraphs: II. The graph coloring game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connected version of the graph coloring game / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-hardness of two graph coloring games / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-completeness of two graph coloring games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game chromatic number of trees and forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game chromatic number of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game Grundy number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected sequential colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric coloring games on incomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsf{PSPACE}-hardness of variants of the graph coloring game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of variants of the graph coloring game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game coloring number of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game coloring number of pseudo partial \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined activation strategy for the marking game / rank
 
Normal rank

Latest revision as of 22:43, 31 July 2024

scientific article
Language Label Description Also known as
English
The connected greedy coloring game
scientific article

    Statements

    The connected greedy coloring game (English)
    0 references
    20 April 2023
    0 references
    graph coloring game
    0 references
    greedy coloring game
    0 references
    game chromatic number
    0 references
    game Grundy number
    0 references
    connected coloring game
    0 references
    PSPACE-hardness
    0 references
    0 references
    0 references
    0 references

    Identifiers