AbstractA total k-coloring of a graph G is a coloring of V(G)∪E(G) using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number of G is the smallest integer k such that G has a total k-coloring. In this paper, it is proved that if G is a planar graph with maximum degree Δ≥7 and without intersecting 5-cycles, that is, every vertex is incident with at most one cycle of length 5, then the total chromatic number of G is Δ+1
AbstractLet G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not i...
A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set...
AbstractLet G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k...
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 Δ≥7 and without intersecting 3-cycles; that is, ...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
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 with maximum degree Δ≥7 and without adjacent 4-cycles, that is, two ...
Let G be a planar graph of maximum degree ? and girth g, and there is an integer t(> g) such that G ...
Let G be a 2-connected planar graph with maximum degree Δ such that G has no cycle of length from 4 ...
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no tw...
AbstractLet G be a planar graph with maximum degree Δ≥7 and without adjacent 4-cycles, that is, two ...
Abstract A total k-coloring of a graph G is a coloring of V (G)∪E(G) using k colors such that no two...
AbstractThe total chromatic number of a graph G, denoted by χ″(G), is the minimum number of colors n...
AbstractLet G be a planar graph with maximum degree Δ≥7 and without intersecting 3-cycles; that is, ...
AbstractLet G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not i...
A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set...
AbstractLet G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k...
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 Δ≥7 and without intersecting 3-cycles; that is, ...
AbstractSuppose that G is a planar graph with maximum degree Δ and without intersecting 4-cycles, th...
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 with maximum degree Δ≥7 and without adjacent 4-cycles, that is, two ...
Let G be a planar graph of maximum degree ? and girth g, and there is an integer t(> g) such that G ...
Let G be a 2-connected planar graph with maximum degree Δ such that G has no cycle of length from 4 ...
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no tw...
AbstractLet G be a planar graph with maximum degree Δ≥7 and without adjacent 4-cycles, that is, two ...
Abstract A total k-coloring of a graph G is a coloring of V (G)∪E(G) using k colors such that no two...
AbstractThe total chromatic number of a graph G, denoted by χ″(G), is the minimum number of colors n...
AbstractLet G be a planar graph with maximum degree Δ≥7 and without intersecting 3-cycles; that is, ...
AbstractLet G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not i...
A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set...
AbstractLet G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k...
DOI
Add to ORKG