Proportional choosability: a new list analogue of equitable coloring
From MaRDI portal
Publication:2319722
DOI10.1016/j.disc.2019.05.011zbMath1418.05064arXiv1806.06966OpenAlexW2809442519MaRDI QIDQ2319722
Michael J. Pelsmajer, Jeffrey A. Mudrock, Benjamin Reiniger, Hemanshu Kaul
Publication date: 20 August 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.06966
Related Items (4)
Proportional choosability of complete bipartite graphs ⋮ A simple characterization of proportionally 2-choosable graphs ⋮ A note on the equitable choosability of complete bipartite graphs ⋮ Proportional 2-choosability with a bounded palette
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equitable and equitable list colorings of series-parallel graphs
- Equitable and equitable list colorings of graphs
- Equitable list colorings of planar graphs without short cycles
- Equitable list coloring of planar graphs without 4- and 6-cycles
- On the complexity of a restricted list-coloring problem
- Equitable coloring and the maximum degree
- Complexity of list coloring problems with a fixed total number of colors
- Restricted coloring models for timetabling
- On equitable coloring of bipartite graphs
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
- New global optima results for the Kauffman \(NK\) model: Handling dependency
- Equitable List Coloring of Graphs with Bounded Degree
- Equitable Coloring
- A list analogue of equitable coloring
- The infamous upper tail
- On chromatic‐choosable graphs
- A Proof of a Conjecture of Ohba
- Perfect Graphs and an Application to Optimizing Municipal Services
This page was built for publication: Proportional choosability: a new list analogue of equitable coloring
