The least connected non-vertex-transitive graph with constant neighbourhoods
Zelinka, Bohdan
Czechoslovak Mathematical Journal, Tome 40 (1990), p. 619-624 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1990-01-01
Classification:  05C35 
@article{102416,
     author = {Bohdan Zelinka},
     title = {The least connected non-vertex-transitive graph with constant neighbourhoods},
     journal = {Czechoslovak Mathematical Journal},
     volume = {40},
     year = {1990},
     pages = {619-624},
     zbl = {0743.05031},
     mrnumber = {1084898},
     language = {en},
     url = {http://dml.mathdoc.fr/item/102416}
}

Zelinka, Bohdan. The least connected non-vertex-transitive graph with constant neighbourhoods. Czechoslovak Mathematical Journal, Tome 40 (1990) pp. 619-624. http://gdmltest.u-ga.fr/item/102416/

Blass A.; Harary F.; Miller Z. Which trees are link graphs?, J. Comb. Theory B 29 (1980), 277-292. (1980) | Article | MR 0602420 | Zbl 0448.05028

Nešetřil J. Teorie grafů, (Theory of Graphs.) SNTL Praha 1979. (1979)