Indice de -recouvrement d’un graphe
Publications mathématiques et informatique de Rennes (1972)
- Issue: 3, page 1-70
Access Full Article
topHow to cite
topChein, Michel, and Riviere, Michel. "Indice de $P$-recouvrement d’un graphe." Publications mathématiques et informatique de Rennes (1972): 1-70. <http://eudml.org/doc/274729>.
@article{Chein1972,
author = {Chein, Michel, Riviere, Michel},
journal = {Publications mathématiques et informatique de Rennes},
language = {fre},
number = {3},
pages = {1-70},
publisher = {Département de Mathématiques et Informatique, Université de Rennes},
title = {Indice de $P$-recouvrement d’un graphe},
url = {http://eudml.org/doc/274729},
year = {1972},
}
TY - JOUR
AU - Chein, Michel
AU - Riviere, Michel
TI - Indice de $P$-recouvrement d’un graphe
JO - Publications mathématiques et informatique de Rennes
PY - 1972
PB - Département de Mathématiques et Informatique, Université de Rennes
IS - 3
SP - 1
EP - 70
LA - fre
UR - http://eudml.org/doc/274729
ER -
References
top- [1] L.W. Beineke, A survey of packings and coverings of graphs,in "the many facets of graph theory", Springer Verlag (1969) 45-53. Zbl0186.27601MR256907
- [2] C. Berge, Graphes et Hypergraphes, Dunod,Paris, 1970. Zbl0213.25702MR357173
- [3] G. Chartrand, D. Geller, S. Hedetniemi, Graphs with forbidden subgraphs, Journal of comb. theory, 10 (1971), 12-41. Zbl0223.05101MR285427
- [4] M. Chein, Indice de P-recouvrement d'un graphe, C . R . Acad . Sc . Paris, t .272,p. 772-775. Zbl0207.54803MR285429
- [5] F. Harary, Graph theory, Addison-Wesley, 1969. Zbl0182.57702MR256911
- [6] F. Harary, The greek alphabet of "graph theory", in "recent progress in combinatorics", Academic Press (1969), 13-20. Zbl0196.27202MR256912
- [7] S. Hedetniemi, Disconnected-colorings of graphs, in "combinatorial structures and their applications", Gordon Breach (1970), 163- 167. Zbl0254.05105MR263679
- [8] S. Hedetniemi,On partitionning planar graphs, Cand.Math. Bull., vol.11,n°2,1968,p. 203-211. Zbl0167.21805MR230644
- [9] D.R. Lick, A class of point partition numbers, in "the many fucets of graph theory", Springer-Verlag (1969) 185-190. Zbl0213.50705MR277432
- [10] W. Taylor, Generalized chromatic numbers, in combinatorial structures and their applications, Gordon Breach (1970) 421-422. Zbl0278.05004MR268082
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.