On the list color function threshold
From MaRDI portal
Publication:6144915
DOI10.1002/jgt.23045arXiv2202.03431MaRDI QIDQ6144915
Akash Kumar, Hemanshu Kaul, Jeffrey A. Mudrock, Paul Shin, Unnamed Author, Unnamed Author
Publication date: 30 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.03431
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- When does the list-coloring function of a graph equal its chromatic polynomial
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- The chromatic polynomial and list colorings
- Criticality, the list color function, and list coloring the Cartesian product of graphs
- The DP color function of joins and vertex-gluings of graphs
- On the chromatic polynomial and counting DP-colorings of graphs
- Non-chromatic-adherence of the DP color function via generalized theta graphs
- On the number of list‐colorings
- Algebraic Graph Theory
This page was built for publication: On the list color function threshold