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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2016

Incremental graph algorithms can respond quickly to small changes in massive graphs by updating rather than recomputing analysis…

2012

In this paper, we consider the intersection graph I (Zn) of gamma sets in the total graph on Zn. We characterize the values of n…

2012

A (p, q) graph G is said to be a square sum graph if there exist a bijection f: V(G)→{0,1,2,….p-1} such that the induced function…

2011

For a commutative ring R, let Z(R) be its set of zero-divisors. The total graph of R, denoted by TΓ(R), is the undirected graph…

2008

For any vertex u ∊ V(G), let TN(u) = {u} ∪ {uυ|uυ ∊ E(G), υ ∊ υ(G)} ∪ {υ ∊ υ(G)|uυ ∊ E(G) and let f be a total k-coloring of G…

2004

Problems of testing program systems modeled by deterministic finite automata are considered. The necessary (and, sometimes…

1990

AbstractThe total chromatic number,χ″(G), of a graphG, is defined to be the minimum number of colours needed to colour the…

1981

1959

The method recognizes that construction of a tree (and hence the pertinent graph) from a given matrix can be done by inspection…