Nombre chromatique et plus longs chemins d'un graphe
- Volume: 1, Issue: 5, page 129-132
- ISSN: 0764-583X
Access Full Article
topHow to cite
topRoy, B.. "Nombre chromatique et plus longs chemins d'un graphe." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 1.5 (1967): 129-132. <http://eudml.org/doc/193088>.
@article{Roy1967,
author = {Roy, B.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
keywords = {topology},
language = {fre},
number = {5},
pages = {129-132},
publisher = {Dunod},
title = {Nombre chromatique et plus longs chemins d'un graphe},
url = {http://eudml.org/doc/193088},
volume = {1},
year = {1967},
}
TY - JOUR
AU - Roy, B.
TI - Nombre chromatique et plus longs chemins d'un graphe
JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
PY - 1967
PB - Dunod
VL - 1
IS - 5
SP - 129
EP - 132
LA - fre
KW - topology
UR - http://eudml.org/doc/193088
ER -
References
top- [1] C. BERGE, La théorie des graphes et ses applications (Dunod, 1958). Zbl0088.15404MR102822
- [2] C. BERGE, Contributions de la théorie des graphes à l'étude des relations d'ordre, (ICC Research Report, n° 67/11 January 1967).
- [3] L. M. VITAVERDetermination of minimal colorings for vertices of a graph by means of booleanpowers of the adjacentcy matrix (Soviet Mathematics (Dorlady) Nov. 1962 Vol. 3 n° 6.) Zbl0126.39302
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.