9 research outputs found
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles
A graph is equitably -choosable if, for any given -uniform list
assignment , is -colorable and each color appears on at most
vertices. A graph is equitably -colorable if
the vertex set can be partitioned into independent subsets ,
, , such that for .
In this paper, we prove that if is a planar graph without chordal - and
-cycles, then is equitably -colorable and equitably -choosable
where .Comment: 21 pages,3 figure