Some constructions of $\lambda$-minimal graphs

Previous | Up | Next

Article

Some constructions of $\lambda$-minimal graphs. (English). Czechoslovak Mathematical Journal, vol. 44 (1994), issue 2, pp. 315-323

MSC: 05C15, 05C35, 05C75 | MR 1281026 | Zbl 0815.05031 | DOI: 10.21136/CMJ.1994.128459

References:

[1] B. Bollobas: Random graphs. Academic Press, 1985. MR 0809996 | Zbl 0592.05052

[2] G.A. Dirac: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25 (1971), 71–76. DOI 10.1007/BF02992776 | MR 0130190

[3] P. Erdös, A. Rényi, V.T. Sós: On a problem of Graph Theory. Studia Scientiarum Mathematicarum Hungarica 1 (1966), 215–235. MR 0223262

[4] O. Frank, F. Harary, M. Plantholt: The line-distinguishing chromatic number of a graph. Ars Combinatoria 14 (1982), 241–252. MR 0683991

[5] F. Harary: Graph Thery. Addison-Wesley, Reading, 1969. MR 0256911

[6] F. Regonati, N. Zagaglia Salvi: Minimal semicomplete graphs. to appear in J. Combin., Inform. and System Sci. MR 1358644

Partner of