|
|
A243252
|
|
Number of simple connected graphs g whose fractional chromatic number is equal to its (integer) chromatic number.
|
|
4
|
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
This implies that there is no difference between the corresponding integer and linear programs defining fractional colorings. Every simple graph has a fractional chromatic number which is a rational number or integer.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
Cf. A243251 (fractional chromatic number is not equal to chromatic number).
Cf. A287007 (not necessarily connected simple graphs with fractional chromatic number equal to chromatic number).
Cf. A287008 (disconnected simple graphs with fractional chromatic number equal to chromatic number).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|