The list-coloring function of signed graphs

From MaRDI portal
Publication:6136674

DOI10.1016/J.DISC.2023.113790arXiv2207.05262OpenAlexW4388812527MaRDI QIDQ6136674FDOQ6136674


Authors: Sumin Huang, Jianguo Qian, Wei Wang Edit this on Wikidata


Publication date: 17 January 2024

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

Abstract: It is known that, for any k-list assignment L of a graph G, the number of L-list colorings of G is at least the number of the proper k-colorings of G when k>(m1)/ln(1+sqrt2). In this paper, we extend the Whitney's broken cycle theorem to L-colorings of signed graphs, by which we show that if then, for any k-assignment L, the number of L-colorings of a signed graph Sigma with m edges is at least the number of the proper k-colorings of Sigma. Further, if L is 0-free (resp., 0-included) and k is even (resp., odd), then the lower bound for k can be improved to (m1)/ln(1+sqrt2).


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




Recommendations




Cites Work






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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136674)