Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949598 | Discrete Applied Mathematics | 2017 | 7 Pages |
Abstract
This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if G has maximum degree Î, then for any graph H on n vertices ch(G[H])â¤(4Î+2)(ch(H)+log2n) and ÏP(G[H])â¤(4Î+2)(ÏP(H)+log2n).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Balázs Keszegh, Xuding Zhu,