Premium
Lower bounds and upper bounds for chromatic polynomials
Author(s) -
Dohmen Klaus
Publication year - 1993
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.3190170109
Subject(s) - combinatorics , mathematics , girth (graph theory) , upper and lower bounds , chromatic scale , simple (philosophy) , undirected graph , discrete mathematics , graph , mathematical analysis , philosophy , epistemology
In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on n vertices having m edges and girth exceeding g © 1993 John Wiley & Sons, Inc.
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