Bounded clique cover of some sparse graphs

We show that f(x)=⌊32x⌋ 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)≤32α(G) for any subcubic triangle-free graph G. Moreover, we provide a θ-bounding function for the class of K4-free...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics 2017-09, Vol.340 (9), p.2208-2216
1. Verfasser:	Munaro, Andrea
Format:	Artikel
Sprache:	eng
Schlagworte:	[formula omitted]-bounded Bounded degree graphs Clique cover Combinatorics Computer Science Discrete Mathematics Mathematics PTAS
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!