Open AccessChromatic Classes of 2-Connected ( n , n + 4 )
Author(s) -
Gee-Choon Lau,
Y. H. Peng
Publication year - 2011
Publication title -
isrn discrete mathematics
Language(s) - English
Resource type - Journals
ISSN - 2090-7788
DOI - 10.5402/2011/430396
Subject(s) - algorithm , database , computer science
For a graph , let (,) be its chromatic polynomial. Two graphs and are chromatically equivalent, denoted ∼, if (,)=(,). A graph is chromatically unique if (,)=(,) implies that ≅. In this paper, we determine all chromatic equivalence classes of 2-connected (,
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