@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 - Recherche Op\'erationnelle}, pages = {163--170}, publisher = {EDP-Sciences}, volume = {20}, number = {2}, year = {1986}, mrnumber = {860913}, zbl = {0608.05049}, language = {fr}, url = {http://archive.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 - Recherche Opérationnelle PY - 1986 SP - 163 EP - 170 VL - 20 IS - 2 PB - EDP-Sciences UR - http://archive.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 - Recherche Opérationnelle %D 1986 %P 163-170 %V 20 %N 2 %I EDP-Sciences %U http://archive.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 - Recherche Opérationnelle, Volume 20 (1986) no. 2, pp. 163-170. http://archive.numdam.org/item/RO_1986__20_2_163_0/
1. Graphes et hypergraphes, Dunod, Paris, 1970. | MR | Zbl
,2. An Upper Bound for the Path Number of a Graph, J. of Graph Theory, vol. 4, 1980, p. 189-201. | MR | Zbl
,3. Computers and Intractability, Freeman, San Francisco, 1979. | MR | Zbl
et ,4. Covering and Packing in Graphs I, Ann. N.Y. Acad. Sc., vol.175, 1970, p. 198-205. | MR | Zbl
,5. Covering and Packing in Graphs II, in: R. C. READ ed., Graph Theory and Computing, Acad. Press, New York, 1972. | Zbl
et ,6. On Covering in Graphs, in: Theory of graphs, Erdos, Katona eds., Tihany, Acad. Press, New York, 1968, p. 231-236. | MR | Zbl
,7. Connexité et indices de recouvrement dans les graphes, Thèse d'État, Université Paris-Nord, 1982.
,8. NP-completeness of Sorne Problems of Partitioning and Covering in Graphs, Discrete Applied Math., vol. 8, 1984, p. 195-208. | MR | Zbl
,9. Some Results on Path Numbers, Proc. of the Louisiana Conf. on Combinatorics, Graph Theory and Computing, 1970, p. 112-135. | MR | Zbl
, et ,