Abstract
We provide a general framework on the coefficients of the graph polynomials of graphs which are Cartesian products. As a corollary, we prove that if is a graph with degrees of vertices , and the graph polynomial contains an "almost central" monomial (that means a monomial , where for all ), then the Cartesian product is -choosable.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.