The strong game colouring number of directed graphs (Q1945951): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2013.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048373074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightness of digraphs in surfaces and directed game chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Map-Coloring Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game chromatic index ofk-degenerate 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: 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: A simple competitive graph coloring algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric graph coloring games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak acyclic coloring and asymmetric coloring games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very asymmetric marking games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric marking games on line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Activation strategy for asymmetric marking games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game colouring directed graphs / 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
Property / cites work
 
Property / cites work: Game coloring the Cartesian product of graphs / rank
 
Normal rank

Latest revision as of 09:36, 6 July 2024

scientific article
Language Label Description Also known as
English
The strong game colouring number of directed graphs
scientific article

    Statements

    The strong game colouring number of directed graphs (English)
    0 references
    0 references
    17 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    digraph
    0 references
    colouring game
    0 references
    marking game
    0 references
    partial 2-tree
    0 references
    planar graph
    0 references
    0 references