no. 2
Recouvrement et partition en chaînes des arêtes d'un graphe cubique
RAIRO. Operations research, Tome 20 (1986) no. 2, pp. 163-170 
@article{RO_1986__20_2_163_0,
     author = {Peroche, B. and Sadi, B.},
     title = {Recouvrement et partition en cha{\^\i}nes des ar\^etes d'un graphe cubique},
     journal = {RAIRO. Operations research},
     pages = {163--170},
     year = {1986},
     publisher = {EDP-Sciences},
     volume = {20},
     number = {2},
     mrnumber = {860913},
     zbl = {0608.05049},
     language = {fr},
     url = {https://www.numdam.org/item/RO_1986__20_2_163_0/}
}
TY  - JOUR
AU  - Peroche, B.
AU  - Sadi, B.
TI  - Recouvrement et partition en chaînes des arêtes d'un graphe cubique
JO  - RAIRO. Operations research
PY  - 1986
SP  - 163
EP  - 170
VL  - 20
IS  - 2
PB  - EDP-Sciences
UR  - https://www.numdam.org/item/RO_1986__20_2_163_0/
LA  - fr
ID  - RO_1986__20_2_163_0
ER  - 
%0 Journal Article
%A Peroche, B.
%A Sadi, B.
%T Recouvrement et partition en chaînes des arêtes d'un graphe cubique
%J RAIRO. Operations research
%D 1986
%P 163-170
%V 20
%N 2
%I EDP-Sciences
%U https://www.numdam.org/item/RO_1986__20_2_163_0/
%G fr
%F RO_1986__20_2_163_0
Peroche, B.; Sadi, B. Recouvrement et partition en chaînes des arêtes d'un graphe cubique. RAIRO. Operations research, Tome 20 (1986) no. 2, pp. 163-170. https://www.numdam.org/item/RO_1986__20_2_163_0/

1. C. Berge, Graphes et hypergraphes, Dunod, Paris, 1970. | Zbl | MR

2. A. Donald, An Upper Bound for the Path Number of a Graph, J. of Graph Theory, vol. 4, 1980, p. 189-201. | Zbl | MR

3. M. R. Garey et D. S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979. | Zbl | MR

4. F. Harary, Covering and Packing in Graphs I, Ann. N.Y. Acad. Sc., vol.175, 1970, p. 198-205. | Zbl | MR

5. F. Harary et J. Schwenk, Covering and Packing in Graphs II, in: R. C. READ ed., Graph Theory and Computing, Acad. Press, New York, 1972. | Zbl

6. L. Lovasz, On Covering in Graphs, in: Theory of graphs, Erdos, Katona eds., Tihany, Acad. Press, New York, 1968, p. 231-236. | Zbl | MR

7. B. Peroche, Connexité et indices de recouvrement dans les graphes, Thèse d'État, Université Paris-Nord, 1982.

8. B. Peroche, NP-completeness of Sorne Problems of Partitioning and Covering in Graphs, Discrete Applied Math., vol. 8, 1984, p. 195-208. | Zbl | MR

9. R. Stanton, D. D. Cowan et L. O. James, Some Results on Path Numbers, Proc. of the Louisiana Conf. on Combinatorics, Graph Theory and Computing, 1970, p. 112-135. | Zbl | MR