✦ LIBER ✦
Claw-free cubic graphs with clique-transversal number half of their order
✍ Scribed by Erfang Shan; Haichao Wang
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 362 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
✦ Synopsis
A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number, denoted by τ C (G), is the minimum cardinality of a cliquetransversal set in G. In 2008, we showed that the clique-transversal number of every clawfree cubic graph is bounded above by half of its order. In this note we characterize claw-free cubic graphs which attain the upper bound.