The relaxed game chromatic number of graphs with cut-vertices

DOI10.1007/S00373-014-1522-1zbMATH Open1328.05069OpenAlexW2081255784MaRDI QIDQ897291FDOQ897291

Authors: Elżbieta Sidorowicz 

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1522-1

Recommendations

• Relaxed game chromatic number of graphs
• The relaxed game chromatic index of \(k\)-degenerate graphs
• The relaxed edge-coloring game and \(k\)-degenerate graphs
• scientific article; zbMATH DE number 5194465
• Relaxed very asymmetric coloring games

zbMATH Keywords

colouring gamerelaxed colouring game

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• Game chromatic number of outerplanar graphs
• Relaxed game chromatic number of graphs
• Colouring game and generalized colouring game on graphs with cut-vertices
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• A simple competitive graph coloring algorithm. II.
• Relaxed game chromatic number of trees and outerplanar graphs
• A simple competitive graph coloring algorithm. III
• Title not available (Why is that?)
• On the relaxed colouring game and the unilateral colouring game
• The relaxed game chromatic index of \(k\)-degenerate graphs

Cited In (7)

• Title not available (Why is that?)
• Relaxed game chromatic number of graphs
• The relaxed game chromatic index of \(k\)-degenerate graphs
• The 6-relaxed game chromatic number of outerplanar graphs
• Colouring game and generalized colouring game on graphs with cut-vertices
• Relaxed game chromatic number of trees and outerplanar graphs
• Relaxed chromatic numbers of graphs

This page was built for publication: The relaxed game chromatic number of graphs with cut-vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897291)