Extremal Properties of the Chromatic Polynomials of Connected 3-chromatic Graphs
Matematički Vesnik (2001)
- Volume: 53, Issue: 217, page 111-116
- ISSN: 0025-5165
Access Full Article
top
How to cite
topIoan Tomescu. "Extremal Properties of the Chromatic Polynomials of Connected 3-chromatic Graphs." Matematički Vesnik 53.217 (2001): 111-116. <http://eudml.org/doc/252964>.
@article{IoanTomescu2001,
author = {Ioan Tomescu},
journal = {Matematički Vesnik},
keywords = {chromatic polynomial; 3-color partition; skeleton of a graph; greatest values},
language = {eng},
number = {217},
pages = {111-116},
publisher = {Društvo matematičara Srbije},
title = {Extremal Properties of the Chromatic Polynomials of Connected 3-chromatic Graphs},
url = {http://eudml.org/doc/252964},
volume = {53},
year = {2001},
}
TY - JOUR
AU - Ioan Tomescu
TI - Extremal Properties of the Chromatic Polynomials of Connected 3-chromatic Graphs
JO - Matematički Vesnik
PY - 2001
PB - Društvo matematičara Srbije
VL - 53
IS - 217
SP - 111
EP - 116
LA - eng
KW - chromatic polynomial; 3-color partition; skeleton of a graph; greatest values
UR - http://eudml.org/doc/252964
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.