The relaxed game chromatic number of graphs with cut-vertices (Q897291): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\) / 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 index of \(k\)-degenerate 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: 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: Relaxed game chromatic number of trees and outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring game and generalized colouring game on graphs with cut-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relaxed colouring game and the unilateral colouring game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310233 / rank
 
Normal rank

Latest revision as of 05:50, 11 July 2024

scientific article
Language Label Description Also known as
English
The relaxed game chromatic number of graphs with cut-vertices
scientific article

    Statements