| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653872 | European Journal of Combinatorics | 2013 | 7 Pages |
Abstract
We obtain lower bounds on the clique number and chromatic number for finite simple graphs using Ollivier’s Ricci curvature. Also we study the relations between girth and curvature. From these, we obtain curvature conditions for 3-colorability of a planar graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hee Je Cho, Seong-Hun Paeng,