Abstract
In this paper we investigate list colouring of a graph in which the sizes of the lists assigned to different vertices can be different. For a given graph G and a class of graphs P we colour G from the lists in such a way that each colour class induces a graph in P. The aim is to find the P-sum-choice-number of G, which means the smallest possible sum of all the list sizes such that, according to the rules, G is colourable for any particular assignment of the lists of these sizes. We prove several general results concerning the P-sum-choice-number of an arbitrary graph. Using some of them, we also estimate or, in the case of complete graphs or some complete bipartite graphs, exactly determine the P-sum-choice-number of a graph, when P is the class of acyclic graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
