The n-minimal chromatic multiplicity of a graph
Colloquium Mathematicae (1984)
- Volume: 49, Issue: 1, page 131-135
- ISSN: 0010-1354
Access Full Article
top
How to cite
topDavid Burns. "The n-minimal chromatic multiplicity of a graph." Colloquium Mathematicae 49.1 (1984): 131-135. <http://eudml.org/doc/265638>.
@article{DavidBurns1984,
author = {David Burns},
journal = {Colloquium Mathematicae},
keywords = {chromatic multiplicity; spanning subgraphs},
language = {eng},
number = {1},
pages = {131-135},
title = {The n-minimal chromatic multiplicity of a graph},
url = {http://eudml.org/doc/265638},
volume = {49},
year = {1984},
}
TY - JOUR
AU - David Burns
TI - The n-minimal chromatic multiplicity of a graph
JO - Colloquium Mathematicae
PY - 1984
VL - 49
IS - 1
SP - 131
EP - 135
LA - eng
KW - chromatic multiplicity; spanning subgraphs
UR - http://eudml.org/doc/265638
ER -
NotesEmbed ?
topYou 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.