The n-minimal chromatic multiplicity of a graph
David Burns
Colloquium Mathematicae, Tome 49 (1984), p. 131-135 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1984-01-01
EUDML-ID : urn:eudml:doc:265638 
@article{bwmeta1.element.desklight-a80a3e21-3f07-4963-9bb0-40c2052b6911,
     author = {David Burns},
     title = {The n-minimal chromatic multiplicity of a graph},
     journal = {Colloquium Mathematicae},
     volume = {49},
     year = {1984},
     pages = {131-135},
     zbl = {0553.05036},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.desklight-a80a3e21-3f07-4963-9bb0-40c2052b6911}
}

David Burns. The n-minimal chromatic multiplicity of a graph. Colloquium Mathematicae, Tome 49 (1984) pp. 131-135. http://gdmltest.u-ga.fr/item/bwmeta1.element.desklight-a80a3e21-3f07-4963-9bb0-40c2052b6911/