Several problems on list colorings, including chromatic-choosability of graphs and Ohba's conjecture, (k, l)-choosability and (k, l)-edge-choosability of some planar graphs, and unique list colorability of graphs, especially for complete multipartite graphs, have been studied in this thesis.
本文研究列表染色的若干问题,包括图的色-可选择性和Ohba猜想、某些平面图的(k,l)-可选择性和(k,l)-边-可选择性,以及图(尤其是完全多部图)的唯一列表可染性。
参考来源 - 关于图的可选择性与唯一列表可染图研究·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐