Paper Info
Title
Sum List Coloring Block Graphs
Abstract
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. We characterize f-choosable functions for block graphs (graphs in which each block is a clique, including trees and line graphs of trees). The sum choice number is the minimum over all choosable functions f of the sum of the sizes in f. The sum choice number of any graph is at most the number of vertices plus the number of edges. We show that this bound is tight for block graphs.
Year
DOI
Venue
2004
10.1007/s00373-004-0564-1
Graphs and Combinatorics
Keywords
Field
DocType
list size,choosable function,sum list,line graph,block graphs,f-choosable function,block graph,sum coloring,proper coloring,list coloring,sum choice number
Discrete mathematics,Block graph,Complete coloring,Combinatorics,Indifference graph,Chordal graph,Clique-sum,Cograph,Mathematics,Split graph,Graph coloring
Journal
Volume
Issue
ISSN
20
4
1435-5914
Citations 
PageRank 
References 
11
1.65
4
Authors
1
Name
Order
Citations
PageRank
Garth Isaak117224.01