A survey of minimum saturated graphs.
Faudree, Jill R., Faudree, Ralph J., Schmitt, John R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Faudree, Jill R., Faudree, Ralph J., Schmitt, John R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
Allen, Peter, Lozin, Vadim, Rao, Michaël (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Liu, Guizhen, Qian, Jianbo, Sun, Jonathan Z., Xu, Rui (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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)...
V. A., Ustimenko (2007)
Serdica Journal of Computing
Similarity:
We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed...
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity: