The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2016.08.010 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963982719 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.03195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game chromatic number and the game colouring number of classes of oriented cactuses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a Planar Graph of Girth 10 into a Forest and a Matching / 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: Planar graphs decomposable into a forest and a matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph with girth 9 into a forest and a matching / 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: 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: Decomposing a graph 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: The game chromatic number and the game colouring number of cactuses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph with girth at least 8 into a forest and a matching / 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.2016.08.010 / rank
 
Normal rank

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
The coloring game on planar graphs with large girth, by a result on sparse cactuses
scientific article

    Statements

    The coloring game on planar graphs with large girth, by a result on sparse cactuses (English)
    0 references
    27 February 2017
    0 references
    graph coloring game
    0 references
    planar graphs
    0 references
    cactuses
    0 references

    Identifiers

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