Activation strategy for relaxed asymmetric coloring games (Q1025957): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.09.047 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.09.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019885790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with linearly bounded Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed game chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed game chromatic number of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed game chromatic number of trees and 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: The Two-Coloring Number and Degenerate Colorings of Planar 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: 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: Q5310233 / 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: Relaxed very asymmetric coloring games / 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: 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 / DOI
 
Property / DOI: 10.1016/J.DISC.2008.09.047 / rank
 
Normal rank

Latest revision as of 13:33, 10 December 2024

scientific article
Language Label Description Also known as
English
Activation strategy for relaxed asymmetric coloring games
scientific article

    Statements

    Activation strategy for relaxed asymmetric coloring games (English)
    0 references
    0 references
    23 June 2009
    0 references
    relaxed chromatic number
    0 references
    asymmetric coloring games
    0 references
    planar graphs
    0 references
    partial \(k\)-trees
    0 references
    pseudo-partial \(k\)-trees
    0 references

    Identifiers