Bounded clique cover of some sparse graphs

Abstract

We show that f (x) = ⌊ 2 x⌋ is a θ-bounding function for the class of subcubic graphs and that it is best possible. This generalizes a result by Henning et al. (2012), who showed that θ (G) ≤ 2α(G) for any subcubic triangle-free graph G. Moreover, we provide a θ-bounding function for the class of K4-free graphs with maximum degree at most 4. Finally, we study the problem Clique Cover for subclasses of planar graphs and graphs with bounded maximum degree: in particular, answering a question of Cerioli et al. (2008), we show it admits a PTAS for planar graphs. © 2017 Elsevier B.V. All rights reserved.

DOI: 10.1016/j.disc.2017.04.004

Cite this paper

@article{Munaro2017BoundedCC, title={Bounded clique cover of some sparse graphs}, author={Andrea Munaro}, journal={Discrete Mathematics}, year={2017}, volume={340}, pages={2208-2216} }