The 6-relaxed game chromatic number of outerplanar graphs (Q998330): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60060537, #quickstatements; #temporary_batch_1708557319324
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2007.11.015 / rank
Normal rank
 
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.2007.11.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984116523 / 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: Game chromatic index ofk-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed game chromatic number of graphs / 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: 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: 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: Edge-partitions of planar graphs and their game coloring numbers / 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: 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: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive colorings of oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the oriented game chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310233 / 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.2007.11.015 / rank
 
Normal rank

Latest revision as of 11:42, 10 December 2024

scientific article
Language Label Description Also known as
English
The 6-relaxed game chromatic number of outerplanar graphs
scientific article

    Statements

    The 6-relaxed game chromatic number of outerplanar graphs (English)
    0 references
    0 references
    0 references
    28 January 2009
    0 references
    relaxed colouring game
    0 references
    game chromatic number
    0 references
    two players game
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references