The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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 incidence 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: ON THE COMPLEXITY OF SOME COLORING GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of quadrangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence and strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence Coloring Game and Arboricity of 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: Covering planar graphs with forests, one having bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game chromatic number of outerplanar graphs / 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: Q5387657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence coloring of \(k\)-degenerated 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: The incidence game chromatic number of paths and subgraphs of wheels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incidence coloring conjecture for graphs of maximum degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a graph into forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game chromatic number of toroidal grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incidence coloring number of Halin graphs and outerplanar graphs / 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: The game coloring number of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined activation strategy for the marking game / rank
 
Normal rank

Latest revision as of 21:04, 9 July 2024

scientific article
Language Label Description Also known as
English
The incidence game chromatic number of \((a,d)\)-decomposable graphs
scientific article

    Statements

    The incidence game chromatic number of \((a,d)\)-decomposable graphs (English)
    0 references
    0 references
    0 references
    24 March 2015
    0 references
    incidence coloring
    0 references
    incidence coloring game
    0 references
    incidence game chromatic number
    0 references
    arboricity
    0 references
    \((a,d)\)-decomposable graphs
    0 references
    0 references
    0 references
    0 references

    Identifiers