Please use this identifier to cite or link to this item:
Title: Clique-transversal sets in cubic graphs
Authors: Liang, Z
Shan, E
Cheng, TCE 
Keywords: Bound
Clique-transversal number
Cubic graph
Issue Date: 2007
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and Lecture notes in bioinformatics), 2007, v. 4614 LNCS, p. 107-115 How to cite?
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 
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 τcG) for cubic graphs, and characterize the extremal cubic graphs achieving the lower bound. In addition, we present a sharp upper bound on τc(G) for claw-free cubic graphs.
Description: 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ESCAPE 2007, Hangzhou, 7-9 April 2007
ISBN: 9783540744498
ISSN: 0302-9743
Appears in Collections:Conference Paper

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


Citations as of Apr 30, 2016

Page view(s)

Last Week
Last month
Checked on Feb 19, 2017

Google ScholarTM


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