Premium
Tight bounds on the chromatic sum of a connected graph
Author(s) -
Thomassen Carsten,
Erdös Paul,
Alavi Yousef,
Malde Paresh J.,
Schwenk Allen J.
Publication year - 1989
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190130310
Subject(s) - combinatorics , mathematics , chromatic scale , graph , windmill graph , critical graph , friendship graph , foster graph , discrete mathematics , graph power , line graph
The chromatic sum of a graph is introduced in the dissertation of Ewa Kubicka. It is the smallest possible total among all proper colorings of G using natural numbers. In this article we determine tight bounds on the chromatic sum of a connected graph with e edges.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom