Geodesic
The least connected non-vertex-transitive graph with constant neighbourhoods
Czechoslovak Mathematical Journal, Tome 40 (1990) no. 4, pp. 619-624
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1990.102416
Classification : 05C35 
@article{10_21136_CMJ_1990_102416,
     author = {Zelinka, Bohdan},
     title = {The least connected non-vertex-transitive graph with constant neighbourhoods},
     journal = {Czechoslovak Mathematical Journal},
     pages = {619--624},
     year = {1990},
     volume = {40},
     number = {4},
     doi = {10.21136/CMJ.1990.102416},
     mrnumber = {1084898},
     zbl = {0743.05031},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1990.102416/}
}
TY  - JOUR
AU  - Zelinka, Bohdan
TI  - The least connected non-vertex-transitive graph with constant neighbourhoods
JO  - Czechoslovak Mathematical Journal
PY  - 1990
SP  - 619
EP  - 624
VL  - 40
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1990.102416/
DO  - 10.21136/CMJ.1990.102416
LA  - en
ID  - 10_21136_CMJ_1990_102416
ER  - 
%0 Journal Article
%A Zelinka, Bohdan
%T The least connected non-vertex-transitive graph with constant neighbourhoods
%J Czechoslovak Mathematical Journal
%D 1990
%P 619-624
%V 40
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1990.102416/
%R 10.21136/CMJ.1990.102416
%G en
%F 10_21136_CMJ_1990_102416
Zelinka, Bohdan. The least connected non-vertex-transitive graph with constant neighbourhoods. Czechoslovak Mathematical Journal, Tome 40 (1990) no. 4, pp. 619-624. doi: 10.21136/CMJ.1990.102416

[1] Blass A., Harary F., Miller Z.: Which trees are link graphs?. J. Comb. Theory B 29 (1980), 277-292. | DOI | MR | Zbl

[2] Nešetřil J.: Teorie grafů. (Theory of Graphs.) SNTL Praha 1979.

Cité par Sources :