The list-coloring function of signed graphs
From MaRDI portal
Publication:6136674
Abstract: It is known that, for any -list assignment of a graph , the number of -list colorings of is at least the number of the proper -colorings of when . In this paper, we extend the Whitney's broken cycle theorem to -colorings of signed graphs, by which we show that if then, for any -assignment , the number of -colorings of a signed graph with edges is at least the number of the proper -colorings of . Further, if is -free (resp., -included) and is even (resp., odd), then the lower bound for can be improved to .
Recommendations
- Mathematical theories of traffic flow
- Modeling, estimation, and their applications for distributed parameter systems
- scientific article; zbMATH DE number 5055270
- Lefschetz's principle
- Superheating behavior in a breakdown reactor
- scientific article; zbMATH DE number 3188569
- scientific article; zbMATH DE number 3133698
- Pointwise Bounds for Solutions of Semilinear Parabolic Equations
Cites work
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- An abstraction of Whitney's broken circuit theorem
- On the number of list‐colorings
- Signed graph coloring
- Signed graphs
- The chromatic number of a signed graph
- The chromatic polynomial and list colorings
- The odd-valued chromatic polynomial of a signed graph
- When does the list-coloring function of a graph equal its chromatic polynomial
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)