Geodesic
The n-minimal chromatic multiplicity of a graph
Colloquium Mathematicum, Tome 49 (1984) no. 1, pp. 131-135 Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences

Voir la notice de l'article

DOI : 10.4064/cm-49-1-131-135

David Burns 1

1 
@article{10_4064_cm_49_1_131_135,
     author = {David Burns},
     title = {The n-minimal chromatic multiplicity of a graph},
     journal = {Colloquium Mathematicum},
     pages = {131--135},
     year = {1984},
     volume = {49},
     number = {1},
     doi = {10.4064/cm-49-1-131-135},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.4064/cm-49-1-131-135/}
}
TY  - JOUR
AU  - David Burns
TI  - The n-minimal chromatic multiplicity of a graph
JO  - Colloquium Mathematicum
PY  - 1984
SP  - 131
EP  - 135
VL  - 49
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4064/cm-49-1-131-135/
DO  - 10.4064/cm-49-1-131-135
LA  - en
ID  - 10_4064_cm_49_1_131_135
ER  - 
%0 Journal Article
%A David Burns
%T The n-minimal chromatic multiplicity of a graph
%J Colloquium Mathematicum
%D 1984
%P 131-135
%V 49
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4064/cm-49-1-131-135/
%R 10.4064/cm-49-1-131-135
%G en
%F 10_4064_cm_49_1_131_135
David Burns. The n-minimal chromatic multiplicity of a graph. Colloquium Mathematicum, Tome 49 (1984) no. 1, pp. 131-135. doi: 10.4064/cm-49-1-131-135

Cité par Sources :