The list-coloring function of signed graphs

DOI10.1016/j.disc.2023.113790arXiv2207.05262OpenAlexW4388812527MaRDI QIDQ6136674

Wei Wang, Sumin Huang, Jian Guo Qian

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

signed graphlist coloringnumber of list colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• When does the list-coloring function of a graph equal its chromatic polynomial
• An abstraction of Whitney's broken circuit theorem
• The chromatic number of a signed graph
• The chromatic polynomial and list colorings
• Signed graphs
• Signed graph coloring
• The odd-valued chromatic polynomial of a signed graph
• On the number of list‐colorings

This page was built for publication: The list-coloring function of signed graphs