About DML-CZ
|
FAQ
|
Conditions of Use
|
Math Archives
|
Contact Us
Previous
|
Up
|
Next
DML-CZ Home
Czechoslovak Mathematical Journal
Volume 40
Issue 4
Article
Zelinka, Bohdan
The least connected non-vertex-transitive graph with constant neighbourhoods
.
(English).
Czechoslovak Mathematical Journal
,
vol. 40 (1990), issue 4
,
pp. 619-624
MSC:
05C35
|
MR 1084898
|
Zbl 0743.05031
| DOI:
10.21136/CMJ.1990.102416
Full entry
|
PDF
(0.7 MB)
Feedback
Similar articles:
References:
[1] Blass A., Harary F., Miller Z.:
Which trees are link graphs?
. J. Comb. Theory B 29 (1980), 277-292.
DOI 10.1016/0095-8956(80)90085-4
|
MR 0602420
|
Zbl 0448.05028
[2] Nešetřil J.:
Teorie grafů
. (Theory of Graphs.) SNTL Praha 1979.
Search
Search
This Collection
Advanced Search
Browse
Collections
Titles
Authors
MSC
About DML-CZ
Partner of