The equitable vertex k-arboricity of a graph G, denoted by v a k = ( G ) , is the smallest integer t such that G has an equitable ( t , k ) -tree-coloring.
Jun 11, 2015 · Abstract:The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research.
Wu et al. investigated the strong equitable vertex k-arboricity of complete bipartite graphs. In this paper, we mainly investigate the strong equitable vertex 2 ...
The strong equitable vertex k-arboricity of complete bipartite equipartition graphs was investigated in 2013. In this paper, we study the strong equitable ...
Recently, Wu et al. introduced the concept of equitable (t,k)-tree-coloring, which can be viewed as a generalization of proper equitable t-coloring. The strong ...
People also ask
What is a tripartite graph in graph theory?
What is equitable edge coloring in graph theory?
What is the chromatic number of complete tripartite graph?
What is a 3 partite graph?
In this paper, we mainly investigate the strong equitable vertex 2-arboricity of complete tripartite graphs. Equitable vertex arboricity has strong applications ...
Jun 11, 2015 · The equitable coloring problem, introduced by Meyer in 1973, has received consid- erable attention and research.
On the Equitable Vertex Arboricity of Graphs. Mao ... complete equipartition tripartite graph, and study the strong equitable vertex arboricity of forests.
This paper brings together two concepts in the theory of graph colourings: edge or total colourings distinguishing adjacent vertices and those breaking ...
BibTeX key: journals/ipl/GuoZM15; entry type: article; year: 2015; journal: Inf. Process. Lett. number: 12; pages: 977-982; volume: 115 ...