Game list colouring of graphs

MaRDI QIDQ873968zbMATH OpenFDO

Authors Mieczysław Borowiecki, Elżbieta Sidorowicz, Zsolt Tuza

Publication date 23 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/127565, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r26.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

two-player gamegame choice number

Mathematics Subject Classification ID

2-person games (91A05) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Recommendations

• A simple competitive graph coloring algorithm. III
• Generalised game colouring of graphs
• The game Grundy number of graphs
• Two graph-colouring games
• Game chromatic number of some network graphs

Cited in

(12)

• Indicated domination game
• Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
• Paired-domination game played in graphs
• Generalised game colouring of graphs
• Choosability and paintability of the lexicographic product of graphs
• The game \(L(d,1)\)-labeling problem of graphs
• Bounds on the game transversal number in hypergraphs
• The game chromatic index of wheels
• scientific article; zbMATH DE number 6863765 (Why is no real title available?)
• Domination game on uniform hypergraphs
• The matcher game played in graphs
• Game coloring the Cartesian product of graphs

This page was built for publication: Game list colouring of graphs

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