The least connected non-vertex-transitive graph with constant neighbourhoods
Czechoslovak Mathematical Journal (1990)
- Volume: 40, Issue: 4, page 619-624
- ISSN: 0011-4642
Access Full Article
top
How to cite
topZelinka, Bohdan. "The least connected non-vertex-transitive graph with constant neighbourhoods." Czechoslovak Mathematical Journal 40.4 (1990): 619-624. <http://eudml.org/doc/13884>.
@article{Zelinka1990,
author = {Zelinka, Bohdan},
journal = {Czechoslovak Mathematical Journal},
keywords = {graph with constant neighbourhoods; neighbourhood realization; neighbourhood graph},
language = {eng},
number = {4},
pages = {619-624},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {The least connected non-vertex-transitive graph with constant neighbourhoods},
url = {http://eudml.org/doc/13884},
volume = {40},
year = {1990},
}
TY - JOUR
AU - Zelinka, Bohdan
TI - The least connected non-vertex-transitive graph with constant neighbourhoods
JO - Czechoslovak Mathematical Journal
PY - 1990
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 40
IS - 4
SP - 619
EP - 624
LA - eng
KW - graph with constant neighbourhoods; neighbourhood realization; neighbourhood graph
UR - http://eudml.org/doc/13884
ER -
References
top- Blass A., Harary F., Miller Z., 10.1016/0095-8956(80)90085-4, J. Comb. Theory B 29 (1980), 277-292. (1980) Zbl0448.05028MR0602420DOI10.1016/0095-8956(80)90085-4
- Nešetřil J., Teorie grafů, (Theory of Graphs.) SNTL Praha 1979. (1979)
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.