Bounding the list color function threshold from above

DOI10.2140/involve.2023.16.849zbMath1530.05046arXiv2207.04831OpenAlexW4389660651MaRDI QIDQ6148301

No author found.

Publication date: 11 January 2024

Published in: Involve (Search for Journal in Brave)

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

zbMATH Keywords

chromatic polynomiallist coloringlist color functionenumerative chromatic-choosabilitylist color function threshold

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Cites Work

• When does the list-coloring function of a graph equal its chromatic polynomial
• The chromatic polynomial and list colorings
• Criticality, the list color function, and list coloring the Cartesian product of graphs
• On the number of list‐colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounding the list color function threshold from above