A survey of minimum saturated graphs.
Faudree, Jill R., Faudree, Ralph J., Schmitt, John R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Acyclic chromatic index and linear arboricity of graphs”
A survey of minimum saturated graphs.
Recent results of Novosibirsk mathematicians in graph theory
L. S. Mel'nikov (1987)
Časopis pro pěstování matematiky
Similarity:
Bipartite toughness and -factors in bipartite graphs.
Liu, Guizhen, Qian, Jianbo, Sun, Jonathan Z., Xu, Rui (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Equitable coloring of Kneser graphs
Robert Fidytek, Hanna Furmańczyk, Paweł Żyliński (2009)
Discussiones Mathematicae Graph Theory
Similarity:
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,n} and two vertices are adjacent if and only if they represent disjoint subsets. In this paper we study the problem of equitable coloring of Kneser graphs, namely, we establish the equitable chromatic number for graphs K(n,2) and K(n,3). In addition, for sufficiently large n, a tight upper bound on equitable chromatic number of graph K(n,k) is given. Finally, the cases of K(2k,k) and K(2k+1,k)...
Linear arboricity of graphs
Mirosław Truszczyński (1986)
Mathematica Slovaca
Similarity: