Abstract
This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if has maximum degree , then for any graph on vertices and .
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.