Total coloring

Known as: Total chromatic number, Total coloring conjecture, Total graph 
In graph theory, total coloring is a type of graph coloring on the vertices and edges of a graph.When used without any qualification, a total… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A total coloring of a graph is an assignment of colors to all the elements of the graph in such a way that no two adjacent or… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2015
2015
The minimum number of total independent sets of V ∪ E of graph G(V,E) is called the total chromatic number of G, denoted by χ′′(G… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
All graphs considered in this paper are simple, finite and undirected, and we follow [5] for the terminologies and notations not… (More)
  • figure 1
Is this relevant?
2011
2011
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and… (More)
  • figure 1
Is this relevant?
2008
2008
The central problem of the total-colorings is the total-coloring conjecture, which asserts that every graph of maximum degree… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs… (More)
Is this relevant?
2002
2002
The equitable total chromatic number v00 e ðGÞ of a graph G is the smallest integer k for which G has a total k-coloring such… (More)
Is this relevant?
2001
2001
An edge coloring of a graph is a function assigning colors to edges so that incident edges acquire distinct colors. The least… (More)
Is this relevant?
1999
1999
Given a graph G, a total k-coloring of G is a simultaneous coloring of the vertices and edges ofGwith at most k colors. If ∆(G… (More)
Is this relevant?
1977
1977
A total coloring of a multigraph G is a coloring of its edges and vertices such that: (i) no two adjacent vertices or edges have… (More)
Is this relevant?