PSPACE-completeness of two graph coloring games (Q2182325): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Grundy number of graphs with few \(P_4\)'s / 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: 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: Partitioning extended \(P_4\)-laden graphs into cliques and stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for the game chromatic number of graphs / 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: Q4201568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_{4}\)-laden graphs: A new class of brittle 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: 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: Restricted coloring problems on graphs with few \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game coloring number of planar graphs with a specific girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal separators in extended \(P_4\)-laden graphs / 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 with a given girth / 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: 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 18:40, 22 July 2024

scientific article
Language Label Description Also known as
English
PSPACE-completeness of two graph coloring games
scientific article

    Statements

    PSPACE-completeness of two graph coloring games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2020
    0 references
    coloring game
    0 references
    game chromatic number
    0 references
    greedy coloring
    0 references
    Grundy number
    0 references
    PSPACE-hardness
    0 references

    Identifiers