Geodesic
Path-Neighborhood Graphs
Discussiones Mathematicae. Graph Theory, Tome 33 (2013) no. 4, pp. 731-745

Voir la notice de l'article provenant de la source Library of Science

A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized. The 3-sun is obtained from a 6-cycle by adding three chords between the three pairs of vertices at distance 2. A P_k-graph is a path-neighborhood graph in which every neighborhood is a P_k, where P_k is the path on k vertices. The P_k-graphs are characterized for k ≤ 4.
Keywords: path-neighborhood graph, outerplanar graph, MOP, snake, 3- sun, k-fun 
@article{DMGT_2013_33_4_a8,
     author = {Laskar, R.C. and Mulder, Henry Martyn},
     title = {Path-Neighborhood {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {731--745},
     publisher = {mathdoc},
     volume = {33},
     number = {4},
     year = {2013},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2013_33_4_a8/}
}
TY  - JOUR
AU  - Laskar, R.C.
AU  - Mulder, Henry Martyn
TI  - Path-Neighborhood Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2013
SP  - 731
EP  - 745
VL  - 33
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2013_33_4_a8/
LA  - en
ID  - DMGT_2013_33_4_a8
ER  - 
%0 Journal Article
%A Laskar, R.C.
%A Mulder, Henry Martyn
%T Path-Neighborhood Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2013
%P 731-745
%V 33
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2013_33_4_a8/
%G en
%F DMGT_2013_33_4_a8
Laskar, R.C.; Mulder, Henry Martyn. Path-Neighborhood Graphs. Discussiones Mathematicae. Graph Theory, Tome 33 (2013) no. 4, pp. 731-745. http://geodesic.mathdoc.fr/item/DMGT_2013_33_4_a8/