2 research outputs found
Complexity of tree-coloring interval graphs equitably
An equitable tree--coloring of a graph is a vertex -coloring such that
each color class induces a forest and the size of any two color classes differ
by at most one. In this work, we show that every interval graph has an
equitable tree--coloring for any integer , solving a conjecture of Wu, Zhang and Li (2013)
for interval graphs, and furthermore, give a linear-time algorithm for
determining whether a proper interval graph admits an equitable
tree--coloring for a given integer . For disjoint union of split graphs,
or -free interval graphs with , we prove that it is
-hard to decide whether there is an equitable tree--coloring when
parameterized by number of colors, or by treewidth, number of colors and
maximum degree, respectively
On Equitable List Arboricity of Graphs
Equitable list arboricity, introduced by Zhang in 2016, generalizes the
notion of equitable list coloring by requiring the subgraph induced by each
color class to be acyclic (instead of edgeless) in addition to the usual upper
bound on the size of each color class. Graph is equitably -list
arborable if an equitable, arborable list coloring of exists for every list
assignment for that associates with each vertex in a list of
available colors. Zhang conjectured that any graph is equitably -list
arborable for each satisfying . We
verify this conjecture for powers of cycles by applying a new lemma which is a
general tool for extending partial equitable, arborable list colorings. We also
propose a stronger version of Zhang's Conjecture for certain connected graphs:
any connected graph is equitably -list arborable for each satisfying
provided is neither a cycle nor a
complete graph of odd order. We verify this stronger version of Zhang's
Conjecture for powers of paths, 2-degenerate graphs, and certain other graphs.
We also show that if is equitably -list arborable it does not
necessarily follow that is equitably -list arborable which addresses
a question of Drgas-Burchardt, Furmanczyk, and Sidorowicz (2018).Comment: 20 page