Clique-transversal sets and weak 2-colorings in graphs of small maximum degree - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2009

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree

Abstract

A clique-transversal set in a graph is a subset of the vertices that meets all maximal complete subgraphs on at least two vertices. We prove that every connected graph of order n and maximum degree three has a clique-transversal set of size left perpendicular19n/30 + 2/15right perpendicular. This bound is tight, since 19n/30 - 1/15 is a lower bound for infinitely many values of n. We also prove that the vertex set of any connected claw-free graph of maximum degree at most four, other than an odd cycle longer than three, can be partitioned into two clique-transversal sets. The proofs of both results yield polynomial-time algorithms that find corresponding solutions.
Fichier principal
Vignette du fichier
1273-4292-1-PB.pdf (129.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00988213 , version 1 (07-05-2014)

Identifiers

Cite

Gábor Bacsó, Zsolt Tuza. Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 2 (2), pp.15--24. ⟨10.46298/dmtcs.453⟩. ⟨hal-00988213⟩

Collections

TDS-MACS
94 View
790 Download

Altmetric

Share

Gmail Facebook X LinkedIn More