Geodesic
Graphs with near v- and e-neighbourhoods
Glasgow mathematical journal, Tome 32 (1990) no. 2, pp. 197-199

Voir la notice de l'article provenant de la source Cambridge University Press

All the graphs considered in this paper are connected finite undirected graphs without loops and multiple edges.By the vertex-neighbourhood (v-neighbourhood) of any vertex x in the graph G we mean the subgraph induced by the set of all vertices adjacent to x. Analogously by the edge-neighbourhood (e-neighbourhood) of any edge f with end vertices x, y we mean the subgraph (f) (or (xy)) induced by the set of all vertices which are adjacent to at least one vertex of the pair x, y and which are different from x, y. 
Fronček, Dalibor. Graphs with near v- and e-neighbourhoods. Glasgow mathematical journal, Tome 32 (1990) no. 2, pp. 197-199. doi: 10.1017/S0017089500009216
@article{10_1017_S0017089500009216,
     author = {Fron\v{c}ek, Dalibor},
     title = {Graphs with near v- and e-neighbourhoods},
     journal = {Glasgow mathematical journal},
     pages = {197--199},
     year = {1990},
     volume = {32},
     number = {2},
     doi = {10.1017/S0017089500009216},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500009216/}
}
TY  - JOUR
AU  - Fronček, Dalibor
TI  - Graphs with near v- and e-neighbourhoods
JO  - Glasgow mathematical journal
PY  - 1990
SP  - 197
EP  - 199
VL  - 32
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500009216/
DO  - 10.1017/S0017089500009216
ID  - 10_1017_S0017089500009216
ER  - 
%0 Journal Article
%A Fronček, Dalibor
%T Graphs with near v- and e-neighbourhoods
%J Glasgow mathematical journal
%D 1990
%P 197-199
%V 32
%N 2
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500009216/
%R 10.1017/S0017089500009216
%F 10_1017_S0017089500009216

[1] 1.FronCek, D., Graphs with given edge neighbourhoods, Czech. Math. J., 39 (114), 1989, 627–630. Google Scholar | DOI

[2] 2.Hell, P., Graphs with given neighborhoods, I, Problimes combinatoires et theorie des graphes, Colloque CNRS, 260, Orsay 1976, 219–223. Google Scholar

[3] 3.Nedela, R., Which cycles are edge-realizable?, Czech. Math. J., to appear. Google Scholar

[4] 4.Zelinka, B., Edge neighbourhoods graphs, Czech. Math. J., 36 (111), 1986, 44–47. Google Scholar

[5] 5.Zykov, A. A., Problem 30, in: Theory of graphs and its applications, Proc. Symp. Smolenice 1963 (Academia Prague 1964). Google Scholar

Cité par Sources :