scientific article; zbMATH DE number 4200245

zbMATH Open0727.05041MaRDI QIDQ3348935FDOQ3348935

Authors: Fred Galvin 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• The game chromatic number of a random hypergraph
• scientific article; zbMATH DE number 1354920
• The biased odd cycle game
• Planarity, Colorability, and Minor Games
• The game chromatic number of random graphs

zbMATH Keywords

chromatic numberwinning strategytriple systemindependent set of verticeshypergraph game

Mathematics Subject Classification ID

2-person games (91A05) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Cited In (8)

• Hypergraph Coloring Games and Voter Models
• Game chromatic number of graphs with locally bounded number of cycles
• Title not available (Why is that?)
• Hypergraph Coloring Games and Voter Models
• Bounds on the game transversal number in hypergraphs
• The game chromatic number of a random hypergraph
• Title not available (Why is that?)
• Abstract colorings, games and ultrafilters

This page was built for publication:

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