On-line list coloring of matroids
From MaRDI portal
Publication:516838
DOI10.1016/j.dam.2016.08.002zbMath1358.05109arXiv1302.2338OpenAlexW2951483333MaRDI QIDQ516838
Michał Lasoń, Wojciech Lubawski
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2338
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Indicated coloring of matroids
- The coloring game on matroids
- Mr. Paint and Mrs. Correct go fractional
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- The game coloring number of planar graphs
- Every planar graph is 5-choosable
- Choosability and fractional chromatic numbers
- A note on list arboricity
- The list chromatic index of a bipartite multigraph
- An exchange theorem for bases of matroids
- List coloring of matroids and base exchange properties
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- Combinatorial Nullstellensatz
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Minimum partition of a matroid into independent subsets
- Decomposition of Finite Graphs Into Forests