Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17951
Title: Clique-transversal number in cubic graphs
Authors: Liang, Z
Shan, E
Cheng, TCE 
Keywords: Claw-free
Clique-transversal number
Cubic graph
Issue Date: 2008
Publisher: Chapman & Hall
Source: Discrete mathematics and theoretical computer science, 2008, v. 10, no. 2, p. 115-124 How to cite?
Journal: Discrete mathematics and theoretical computer science 
Abstract: A clique-transversal set S of a graph G is a set of vertices of G such that S meets all cliques of G. The clique-transversal number, denoted τC(G), is the minimum cardinality of a clique-transversal set in G. In this paper we present an upper bound and a lower bound on τC(G) for a connected cubic graph G and characterize the extremal cubic graphs achieving the lower bound. Also, we show that every connected claw-free cubic graph G is weakly 2-colorable, this implies that it has clique-transversal number at most one-half its order.
URI: http://hdl.handle.net/10397/17951
ISSN: 1462-7264
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
Citations as of Sep 18, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Sep 24, 2017

Page view(s)

127
Last Week
2
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.