On the equitable choosability of the disjoint union of stars

DOI10.1007/s00373-022-02571-2OpenAlexW3049607429MaRDI QIDQ2084783

Hemanshu Kaul, Tim Wagstrom, Jeffrey A. Mudrock

Publication date: 13 October 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringlist coloringequitable coloringequitable choosability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
• Equitable colorings of bounded treewidth graphs
• Equitable coloring and the maximum degree
• Total equitable list coloring
• On equitable coloring of bipartite graphs
• A note on the equitable choosability of complete bipartite graphs
• A simple characterization of proportionally 2-choosable graphs
• New global optima results for the Kauffman \(NK\) model: Handling dependency
• Equitable Coloring
• A list analogue of equitable coloring
• The infamous upper tail
• Perfect Graphs and an Application to Optimizing Municipal Services

This page was built for publication: On the equitable choosability of the disjoint union of stars