On the relaxed colouring game and the unilateral colouring game

DOI10.1007/S00373-013-1326-8MaRDI QIDQ742610zbMATH OpenOpenAlexWikidataFDO

Authors Elżbieta Sidorowicz

Publication date 19 September 2014

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00373-013-1326-8

zbMATH Keywords

colouring gamegeneralized colouring gamerelaxed colouring game

Mathematics Subject Classification ID

2-person games (91A05) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Relaxed very asymmetric coloring games
• Relaxed game chromatic number of graphs
• The relaxed game chromatic number of graphs with cut-vertices
• Activation strategy for relaxed asymmetric coloring games
• scientific article; zbMATH DE number 5194465

Cites work

• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• scientific article; zbMATH DE number 5194465 (Why is no real title available?)
• A simple competitive graph coloring algorithm
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm. III
• Activation strategy for asymmetric marking games
• Activation strategy for relaxed asymmetric coloring games
• Colouring game and generalized colouring game on graphs with cut-vertices
• Competitive colorings of oriented graphs
• Game chromatic index of \(k\)-degenerate graphs
• Game chromatic number of outerplanar graphs
• Generalised game colouring of graphs
• Note on the game chromatic index of trees
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Relaxed game chromatic number of graphs
• Relaxed game chromatic number of trees and outerplanar graphs
• The 6-relaxed game chromatic number of outerplanar graphs
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• The game coloring number of planar graphs
• The relaxed game chromatic index of \(k\)-degenerate graphs

Cited in

(5)

• Complete multipartite graphs and the relaxed coloring game
• Colouring game and generalized colouring game on graphs with cut-vertices
• The relaxed game chromatic number of graphs with cut-vertices
• Activation strategy for relaxed asymmetric coloring games
• Relaxed very asymmetric coloring games

This page was built for publication: On the relaxed colouring game and the unilateral colouring game

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