The coloring game on matroids

DOI10.1016/j.disc.2016.11.020zbMath1355.05171arXiv1211.2456OpenAlexW2951267158MaRDI QIDQ507509

Michał Lasoń

Publication date: 6 February 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.2456

zbMATH Keywords

acyclic coloringgame coloringgame arboricitymatroid coloring

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Games involving graphs (91A43) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

On monotonicity in maker-breaker graph colouring games ⋮ On the toric ideal of a matroid ⋮ Indicated coloring of matroids ⋮ On-line list coloring of matroids ⋮ List coloring of matroids and base exchange properties

Cites Work

• Unnamed Item
• Unnamed Item
• Indicated coloring of matroids
• The game coloring number of planar graphs
• A note on list arboricity
• List coloring of matroids and base exchange properties
• The game of arboricity
• ON THE COMPLEXITY OF SOME COLORING GAMES
• The Map-Coloring Game
• Minimum partition of a matroid into independent subsets
• Decomposition of Finite Graphs Into Forests

This page was built for publication: The coloring game on matroids