Biclique edge-choosability in some classes of graphs∗
Keyword(s):
In this paper we study the problem of coloring the edges of a graph for any k-list assignment such that there is no maximal monochromatic biclique, in other words, the k-biclique edge-choosability problem. We prove that the K3free graphs that are not odd cycles are 2-star edge-choosable, chordal bipartite graphs are 2-biclique edge-choosable and we present a lower bound for the biclique choice index of power of cycles and power of paths. We also provide polynomial algorithms to compute a 2-biclique (star) edge-coloring for K3-free and chordal bipartite graphs for any given 2-list assignment to edges.
Keyword(s):
2008 ◽
Vol Vol. 10 no. 3
(Graph and Algorithms)
◽
Keyword(s):
2015 ◽
Vol 30
◽
pp. 21-28
◽
2005 ◽
Vol 145
(3)
◽
pp. 479-482
◽
Keyword(s):
2003 ◽
pp. 111-134
Keyword(s):