• Title, Summary, Keyword: clique-transversal number

Search Result 1, Processing Time 0.032 seconds

CLIQUE-TRANSVERSAL SETS IN LINE GRAPHS OF CUBIC GRAPHS AND TRIANGLE-FREE GRAPHS

  • KANG, LIYING;SHAN, ERFANG
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.5
    • /
    • pp.1423-1431
    • /
    • 2015
  • 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 is the minimum cardinality of a clique-transversal set in G. For every cubic graph with at most two bridges, we first show that it has a perfect matching which contains exactly one edge of each triangle of it; by the result, we determine the exact value of the clique-transversal number of line graph of it. Also, we present a sharp upper bound on the clique-transversal number of line graph of a cubic graph. Furthermore, we prove that the clique-transversal number of line graph of a triangle-free graph is at most the chromatic number of complement of the triangle-free graph.