Recouvrement et partition en chaînes des arêtes d'un graphe cubique

B. Peroche; B. Sadi

RAIRO - Operations Research - Recherche Opérationnelle (1986)

  • Volume: 20, Issue: 2, page 163-170
  • ISSN: 0399-0559

How to cite

top

Peroche, B., and Sadi, B.. "Recouvrement et partition en chaînes des arêtes d'un graphe cubique." RAIRO - Operations Research - Recherche Opérationnelle 20.2 (1986): 163-170. <http://eudml.org/doc/104897>.

@article{Peroche1986,
author = {Peroche, B., Sadi, B.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {graph cover; cubic graph; path number; linear algorithm},
language = {fre},
number = {2},
pages = {163-170},
publisher = {EDP-Sciences},
title = {Recouvrement et partition en chaînes des arêtes d'un graphe cubique},
url = {http://eudml.org/doc/104897},
volume = {20},
year = {1986},
}

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
PB - EDP-Sciences
VL - 20
IS - 2
SP - 163
EP - 170
LA - fre
KW - graph cover; cubic graph; path number; linear algorithm
UR - http://eudml.org/doc/104897
ER -

References

top
  1. 1. C. BERGE, Graphes et hypergraphes, Dunod, Paris, 1970. Zbl0213.25702MR357173
  2. 2. A. DONALD, An Upper Bound for the Path Number of a Graph, J. of Graph Theory, vol. 4, 1980, p. 189-201. Zbl0403.05056MR570353
  3. 3. M. R. GAREY et D. S. JOHNSON, Computers and Intractability, Freeman, San Francisco, 1979. Zbl0411.68039MR519066
  4. 4. F. HARARY, Covering and Packing in Graphs I, Ann. N.Y. Acad. Sc., vol.175, 1970, p. 198-205. Zbl0226.05119MR263677
  5. 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. Zbl0645.05058
  6. 6. L. LOVASZ, On Covering in Graphs, in: Theory of graphs, Erdos, Katona eds., Tihany, Acad. Press, New York, 1968, p. 231-236. Zbl0157.31202MR233723
  7. 7. B. PEROCHE, Connexité et indices de recouvrement dans les graphes, Thèse d'État, Université Paris-Nord, 1982. 
  8. 8. B. PEROCHE, NP-completeness of Sorne Problems of Partitioning and Covering in Graphs, Discrete Applied Math., vol. 8, 1984, p. 195-208. Zbl0541.05048MR743024
  9. 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. Zbl0223.05120MR282874

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.