AbstractLet G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k, where k⩾4. Then the list chromatic index χl′(G)=Δ and the list total chromatic number χl″(G)=Δ+1 if (Δ,k)∈{(7,4),(6,5),(5,8)}. Furthermore, χl′(G)=Δ if (Δ,k)∈{(4,14)}
AbstractLet G be a planar graph without 5-cycles or without 6-cycles. In this paper, we prove that i...
Abstract. Giving a planar graph G, let ′l(G) and l (G) denote the list edge chromatic number and li...
AbstractA total k-coloring of a graph G is a coloring of V(G)∪E(G) using k colors such that no two a...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
AbstractLet G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k...
AbstractTwo cycles are said to be adjacent if they share a common edge. Let G be a planar graph with...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
AbstractWe investigate structural properties of planar graphs without triangles or without 4-cycles,...
According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesi...
AbstractLet G be a planar graph with maximum degree Δ≥7 and without adjacent 4-cycles, that is, two ...
AbstractLet G be a planar graph with maximum degree Δ(G). In this paper, we prove that Gis (Δ(G)+1)-...
AbstractSome structural properties of planar graphs without 4-cycles are investigated. By the struct...
In this paper we prove that if G is a planar graph, and each 7-cycle contains at most two chords, th...
International audienceFor planar graphs, we consider the problems of list edge coloring and list tot...
AbstractLet G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not i...
AbstractLet G be a planar graph without 5-cycles or without 6-cycles. In this paper, we prove that i...
Abstract. Giving a planar graph G, let ′l(G) and l (G) denote the list edge chromatic number and li...
AbstractA total k-coloring of a graph G is a coloring of V(G)∪E(G) using k colors such that no two a...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
AbstractLet G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k...
AbstractTwo cycles are said to be adjacent if they share a common edge. Let G be a planar graph with...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
AbstractWe investigate structural properties of planar graphs without triangles or without 4-cycles,...
According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesi...
AbstractLet G be a planar graph with maximum degree Δ≥7 and without adjacent 4-cycles, that is, two ...
AbstractLet G be a planar graph with maximum degree Δ(G). In this paper, we prove that Gis (Δ(G)+1)-...
AbstractSome structural properties of planar graphs without 4-cycles are investigated. By the struct...
In this paper we prove that if G is a planar graph, and each 7-cycle contains at most two chords, th...
International audienceFor planar graphs, we consider the problems of list edge coloring and list tot...
AbstractLet G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not i...
AbstractLet G be a planar graph without 5-cycles or without 6-cycles. In this paper, we prove that i...
Abstract. Giving a planar graph G, let ′l(G) and l (G) denote the list edge chromatic number and li...
AbstractA total k-coloring of a graph G is a coloring of V(G)∪E(G) using k colors such that no two a...
DOI
Add to ORKG