AbstractLet G be a planar graph with maximum degree Δ(G). In this paper, we prove that Gis (Δ(G)+1)-total choosable if G has no cycle of length from 4 to k and has minimum distance at least dΔ between triangles for (Δ(G),k,dΔ)=(6,4,1),(5,5,2),(5,6,1),(5,7,0),(4,6,3), (4,7,2),(4,10,1)
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if ∆(G) ≥ 9, then χ′l(G)...
According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesi...
Let G be a planar graph of maximum degree ? and girth g, and there is an integer t(> g) such that G ...
AbstractLet G be a planar graph with maximum degree Δ(G). In this paper, we prove that Gis (Δ(G)+1)-...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
AbstractA total k-coloring of a graph G is a coloring of V(G)∪E(G) using k colors such that no two a...
AbstractLet G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k...
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 Δ≥7 and without intersecting 3-cycles; that is, ...
AbstractLet G be a planar graph with maximum degree 4. It is known that G is 8-totally choosable. It...
AbstractTwo cycles are said to be adjacent if they share a common edge. Let G be a planar graph with...
AbstractLet G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not i...
AbstractWe investigate structural properties of planar graphs without triangles or without 4-cycles,...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
AbstractThe Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)-totally-...
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if ∆(G) ≥ 9, then χ′l(G)...
According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesi...
Let G be a planar graph of maximum degree ? and girth g, and there is an integer t(> g) such that G ...
AbstractLet G be a planar graph with maximum degree Δ(G). In this paper, we prove that Gis (Δ(G)+1)-...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
AbstractA total k-coloring of a graph G is a coloring of V(G)∪E(G) using k colors such that no two a...
AbstractLet G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k...
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 Δ≥7 and without intersecting 3-cycles; that is, ...
AbstractLet G be a planar graph with maximum degree 4. It is known that G is 8-totally choosable. It...
AbstractTwo cycles are said to be adjacent if they share a common edge. Let G be a planar graph with...
AbstractLet G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not i...
AbstractWe investigate structural properties of planar graphs without triangles or without 4-cycles,...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
AbstractThe Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)-totally-...
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if ∆(G) ≥ 9, then χ′l(G)...
According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesi...
Let G be a planar graph of maximum degree ? and girth g, and there is an integer t(> g) such that G ...
DOI
Add to ORKG