Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,162,756 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
1-planar graph
Brooks' theorem
Edge coloring
Fractional coloring
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Total Graphs Associated to a Commutative Ring
Khalida Nazzal
2016
Corpus ID: 27565530
LetR be a commutative ring with nonzero unity. Let Z(R) be the set of all zerodivisors ofR. The total graph of R, denoted byT…
Expand
2014
2014
Computing the Kirchhoff Index of Some xyz-Transformations of Regular Molecular Graphs
Yujun Yang
International Conference on Intelligent Computing
2014
Corpus ID: 41719680
Let G be a connected molecular graph. The resistance distance between any two vertices of G is defined as the effective…
Expand
2012
2012
Computer algebra experimentation with Higmanian rank 5 association schemes on 40 vertices and related combinatorial objects
M. Klin
,
M. Muzychuk
,
Matan Ziv-Av
2012
Corpus ID: 125894174
Paying our tribute to the mathematical heritage of D. G. Higman we investigate imprimitive association schemes on 40 points with…
Expand
2010
2010
Smarandachely Adjacent Vertex Total Coloring of Generalized Imitative Thomassen Graph
Wen Fei
2010
Corpus ID: 124712400
Smarandachely adjacent vertex total chromatic number of graph G(V,E) is the smallest number of total colors assignable to V and E…
Expand
2009
2009
On Adjacent Vertex-distinguishing-equitable Total Coloring of Double Graphs
Zhang Zhong-fu
2009
Corpus ID: 124931095
We studied adjacent vertex-distinguishing-equitable total coloring(AVDETC) of some double graphs,and developed the adjacent…
Expand
2008
2008
DYNA-RANK: Efficient Calculation and Updation of PageRank
Mandar Kale
,
P. Thilagam
International Conference on Computer Science and…
2008
Corpus ID: 17041919
The decision of the ranking of web page is very important in web, as its growing and changing very rapidly. Ranking of the…
Expand
2006
2006
Total Chromatic Number of the Join of K_(m,n) and C_n
Li
,
Guang-rong
,
Zhang
,
Li-min
2006
Corpus ID: 118230294
The total chromatic number XT(G) of a graph G is the minimum number of colors needed to color the elements (vertices and edges…
Expand
2001
2001
Total Chromatic Number of Graphs of High Degree
Xie De
2001
Corpus ID: 123315619
It is proved that if the number r(G) of vertices with maximum degree Δ(G) in a graph G satisfies r(G)≤ ｜V(G)｜-Δ(G)-1 and δ(G)+2…
Expand
1996
1996
List Total Colorings of Graphs
M. Juvan
,
R. Škrekovski
1996
Corpus ID: 12667809
We introduce the concept of list total colorings and prove that every multigraph of maximum degree 3 is 5-total-choosable. We…
Expand
1959
1959
How to grow your own trees from given cut-set or tie-set matrices
E. Guillemin
IRE Transactions on Information Theory
1959
Corpus ID: 20257661
The method recognizes that construction of a tree (and hence the pertinent graph) from a given matrix can be done by inspection…
Expand