| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651635 | Electronic Notes in Discrete Mathematics | 2015 | 6 Pages |
Abstract
A clock is a cycle with a vertex that has exactly two neighbors on the cycle. We show that (triangle, cube, clock)-free graphs of girth at least 9 always contain a vertex of degree 2, partially answering to a conjecture of Trotignon. As a second result, we show that the class of clock-free graphs is χ-bounded by max(4,ω(G)).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
