Bacsó, Gábor and Tuza, Zsolt - Clique-transversal sets and weak 2-colorings in graphs of small maximum degree

dmtcs:453 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, Vol. 11 no. 2
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree

Authors: Bacsó, Gábor and Tuza, Zsolt

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.


Source : oai:HAL:hal-00988213v1
Volume: Vol. 11 no. 2
Section: Graph and Algorithms
Published on: January 1, 2009
Submitted on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 27 times.
This article's PDF has been downloaded 20 times.