Indicated coloring of matroids

DOI10.1016/j.dam.2014.07.004zbMath1303.05025arXiv1302.3811OpenAlexW2076592714MaRDI QIDQ477356

Michał Lasoń

Publication date: 3 December 2014

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

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

zbMATH Keywords

chromatic numbermatroidgame coloringindicated coloring

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (8)

Bicircular matroids are 3-colorable ⋮ Indicated coloring of the Mycielskian of some families of graphs ⋮ Indicated coloring game on Cartesian products of graphs ⋮ The coloring game on matroids ⋮ On-line list coloring of matroids ⋮ On indicated coloring of some classes of graphs ⋮ On game chromatic vertex-critical graphs ⋮ List coloring of matroids and base exchange properties

Cites Work

• Unnamed Item
• The coloring game on matroids
• On-line list coloring of matroids
• A note on the game chromatic index of graphs
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• A note on list arboricity
• A simple competitive graph coloring algorithm
• Indicated coloring of graphs
• The star arboricity of graphs
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• The game of arboricity
• ON THE COMPLEXITY OF SOME COLORING GAMES
• A Solution of the Shannon Switching Game
• Minimum partition of a matroid into independent subsets
• Lehmans switching game and a theorem of Tutte and Nash-Williams

This page was built for publication: Indicated coloring of matroids