LetGbe a planar graph with maximum degreeΔ.In this paper,we prove that if any4-cycle is not adjacent to ani-cycle for anyi∈{3,4}in G,then the list edge chromatic numberχl(G)=Δand the list total chromatic number...LetGbe a planar graph with maximum degreeΔ.In this paper,we prove that if any4-cycle is not adjacent to ani-cycle for anyi∈{3,4}in G,then the list edge chromatic numberχl(G)=Δand the list total chromatic numberχl(G)=Δ+1.展开更多
In this paper we prove that if G is a planar graph with △ = 5 and without 4-cycles or 6-cycles, then G is edge-6-choosable. This consequence together with known (△ + 1)-choosable, where△ denotes the maximum degree ...In this paper we prove that if G is a planar graph with △ = 5 and without 4-cycles or 6-cycles, then G is edge-6-choosable. This consequence together with known (△ + 1)-choosable, where△ denotes the maximum degree of G.展开更多
基金Supported by National Natural Science Foundation of China(Grant Nos.11201440 and 11271006)Graduate Independent Innovation Foundation of Shandong University(Grant No.yzc12100)
文摘LetGbe a planar graph with maximum degreeΔ.In this paper,we prove that if any4-cycle is not adjacent to ani-cycle for anyi∈{3,4}in G,then the list edge chromatic numberχl(G)=Δand the list total chromatic numberχl(G)=Δ+1.
基金supported partially by the National Natural Science Foundation of China(Grant No.10471 131)the Natural Science Foundation of Zhejiang Province(Grant No.M103094)
文摘In this paper we prove that if G is a planar graph with △ = 5 and without 4-cycles or 6-cycles, then G is edge-6-choosable. This consequence together with known (△ + 1)-choosable, where△ denotes the maximum degree of G.