Geodesic
On minimal graphs of diameter $2$ with every edge in a $3$-cycle
Mathematica slovaca, Tome 36 (1986) no. 2, pp. 145-149
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C35, 05C99 
@article{MASLO_1986_36_2_a6,
     author = {Plesn{\'\i}k, J\'an},
     title = {On minimal graphs of diameter $2$ with every edge in a $3$-cycle},
     journal = {Mathematica slovaca},
     pages = {145--149},
     year = {1986},
     volume = {36},
     number = {2},
     mrnumber = {849705},
     zbl = {0603.05040},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1986_36_2_a6/}
}
TY  - JOUR
AU  - Plesník, Ján
TI  - On minimal graphs of diameter $2$ with every edge in a $3$-cycle
JO  - Mathematica slovaca
PY  - 1986
SP  - 145
EP  - 149
VL  - 36
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1986_36_2_a6/
LA  - en
ID  - MASLO_1986_36_2_a6
ER  - 
%0 Journal Article
%A Plesník, Ján
%T On minimal graphs of diameter $2$ with every edge in a $3$-cycle
%J Mathematica slovaca
%D 1986
%P 145-149
%V 36
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1986_36_2_a6/
%G en
%F MASLO_1986_36_2_a6
Plesník, Ján. On minimal graphs of diameter $2$ with every edge in a $3$-cycle. Mathematica slovaca, Tome 36 (1986) no. 2, pp. 145-149. http://geodesic.mathdoc.fr/item/MASLO_1986_36_2_a6/

[1] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Graphs and Digraphs. Prindle, Weber and Schmidt, Boston, 1979. | MR

[2] BERMOND J. C., BOLLOBÁS B.: The diameter of graphs - a survey. In: Proc. 12th S. E. Conf. Graph Theory and Computing. Congressus Numerantium 32, 1981, 3-27. | MR | Zbl

[3] BERMOND J. C., BOND J., PAOLI M., PEYRAT C.: Graphs and interconnection networks: diameter and vulnerability. In: Proc. 9th British Combinatorial Conference. London Math. Society, London, 1983, 1-30. | MR | Zbl

[4] CACETTA L., HAGGKVIST R.: On diameter critical graphs. Discrete Math. 28, 1979, 223-229. | MR

[5] CHVÁTAL V., THOMASSEN C.: Distances in orientations of graphs. J. Combin. Theory B 24, 1978, 61-75. | MR

[6] GLIVIAK F.: On certain edge-critical graphs of a given diameter. Mat. časopis 25, 1975, 249-263. | MR | Zbl

[7] GLIVJAK F., KYŠ P., PLESNÍK J.: On the extension of graphs with a given diameter without superfluous edges. Mat. časopis 19, 1969, 92-101. | MR

[8] HARARY F.: Graph Theory. Addison-Wesley, Reading, MA, 1969. | MR | Zbl

[9] KRISHNAMOORTHY V., NANDAKUMAR R.: A class of counterexamples to a conjecture on diameter critical graphs. In: Combinatorics and Graph Theory (Proc. Second Symp. Calcutta, 1980). Lecture Notes in Math. 885, Springer, Berlin, 1981, 297-300. | MR

[10] PLESNÍK J.: Critical graphs of given diameter. Acta Fac. Rerum Natur. Univ. Comen. Math. 30, 1975, 71-93. | MR | Zbl

[11] PLESNÍK J.: Diametrically critical tournaments. Časopis pěst. mat. 100, 1975, 361-370. | MR | Zbl