论文信息 - Restricted Extension of Sparse Partial Edge Colorings of Complete graphs

Restricted Extension of Sparse Partial Edge Colorings of Complete graphs

Given a partial edge coloring of a complete graph $K_n$ and lists of allowed colors for the non-colored edges of $K_n$, can we extend the partial edge coloring to a proper edge coloring of $K_n$ using only colors from the lists? We prove that this question has a positive answer in the case when both the partial edge coloring and the color lists satisfy certain sparsity conditions.

Carl Johan Casselgren | Lan Anh Pham

[1] Jirí Fiala. NP completeness of the edge precoloring extension problem on bipartite graphs , 2003, J. Graph Theory.

[2] Roland Häggkvist,et al. Some upper bounds on the total and list chromatic numbers of multigraphs , 1992, J. Graph Theory.

[3] P. Bartlett,et al. Completions of ε ‐Dense Partial Latin Squares , 2013 .

[4] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.

[5] Lan Anh Pham. On Restricted Colorings of (d, s)-Edge Colorable Graphs , 2020, Graphs Comb..

[6] Daniela Kühn,et al. Clique decompositions of multipartite graphs and completion of Latin squares , 2016, J. Comb. Theory, Ser. A.

[8] Klas Markström,et al. Edge precoloring extension of hypercubes , 2017, J. Graph Theory.

[9] A. J. W. HILTON. THANK EVANS ! , 1983 .

[10] Lina J. Andrén. On Latin squares and avoidable arrays , 2010 .

[11] Lina Jansson Andrén,et al. Avoiding Arrays of Odd Order by Latin Squares , 2013, Comb. Probab. Comput..

[12] Klas Markström,et al. Restricted extension of sparse partial edge colorings of hypercubes , 2020, Discret. Math..

[13] Klas Markström,et al. Restricted completion of sparse partial Latin squares , 2019, Comb. Probab. Comput..

[14] T. Evans. Embedding Incomplete Latin Squares , 1960 .

[15] Roland Häggkvist. A note on latin squares with restricted support , 1989, Discret. Math..