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

Voir la notice de l'article dans European Digital Mathematics Library

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 Pk-graph is a path-neighborhood graph in which every neighborhood is a Pk, where Pk is the path on k vertices. The Pk-graphs are characterized for k ≤ 4.
Classification : 05C10, 05C38, 05C75
Mots-clés : path-neighborhood graph, outerplanar graph, MOP, snake, 3- sun, k-fun, 3-sun, -fun 
@article{DMGT_2013__33_4_268278,
     author = {R.C. Laskar and Henry Martyn Mulder},
     title = {Path-Neighborhood {Graphs}},
     journal = {Discussiones Mathematicae Graph Theory},
     pages = {731},
     publisher = {mathdoc},
     volume = {33},
     number = {4},
     year = {2013},
     zbl = {1295.05195},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_4_268278/}
}
TY  - JOUR
AU  - R.C. Laskar
AU  - Henry Martyn Mulder
TI  - Path-Neighborhood Graphs
JO  - Discussiones Mathematicae Graph Theory
PY  - 2013
SP  - 731
VL  - 33
IS  - 4
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_4_268278/
LA  - en
ID  - DMGT_2013__33_4_268278
ER  - 
%0 Journal Article
%A R.C. Laskar
%A Henry Martyn Mulder
%T Path-Neighborhood Graphs
%J Discussiones Mathematicae Graph Theory
%D 2013
%P 731
%V 33
%N 4
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_4_268278/
%G en
%F DMGT_2013__33_4_268278
R.C. Laskar; Henry Martyn Mulder. Path-Neighborhood Graphs. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 4, p. 731. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_4_268278/