142
Views
2
CrossRef citations to date
0
Altmetric
Section A

The signed maximum-clique transversal number of regular graphs

&
Pages 741-751 | Received 03 Aug 2010, Accepted 18 Dec 2011, Published online: 23 Feb 2012

References

  • Andreae , T. 1998 . On the clique-transversal number of chordal graphs . Discrete Math. , 191 : 3 – 11 .
  • Andreae , T. and Flotow , C. 1996 . On covering all cliques of a chordal graph . Discrete Math. , 149 : 299 – 302 .
  • Andreae , T. , Schughart , M. and Tuza , Zs. 1991 . Clique-transversal sets of line graphs and complements of line graphs . Discrete Math. , 88 : 11 – 20 .
  • Bacsó , G. and Tuza , Zs. 2009 . Clique-transversal sets and weak 2-colorings in graphs of small maximum degree . Discrete Math. Theoret. Comput. Sci. , 11 ( 2 ) : 15 – 24 .
  • Balachandhran , V. , Nagavamsi , P. and Rangan , C. P. 1996 . Clique transversal and clique independence on comparability graphs . Inform. Process. Lett. , 58 : 181 – 184 .
  • Berge , C. 1989 . Hypergraphs , Amsterdam : North-Holland .
  • Bollobás , B. 2001 . Modern Graph Theory , New York : Springer .
  • Chang , M. S. , Kloks , T. and Lee , C. M. Maximum clique transversals . Proceedings of the 27th International Workshop on Graph-theoretic Concepts in Computer Science. vol. 2204 . pp. 32 – 43 . Berlin : Springer . Lecture Notes in Computer Science
  • Erdős , P. , Gallai , T. and Tuza , Zs. 1992 . Covering the cliques of a graph with vertices . Discrete Math. , 108 : 279 – 289 .
  • Lee , C. M. 2010 . Variations of maximum-clique transversal sets on graphs . Ann. Oper. Res. , 181 ( 1 ) : 21 – 66 .
  • Locke , S. C. and Lou , F. 1997 . Finding independent sets in K 4-free 4-regular connected graphs . J. Combin. Theory Ser. B , 71 : 85 – 110 .
  • Shan , E. F. and Kang , L. Y. 2011 . Clique-transversal sets in 4-regular claw-free graphs . Acta Math. Sinica , 27 : 883 – 890 .
  • Shan , E. F. , Cheng , T. C.E. and Kang , L. Y. 2008 . Bounds on the clique-transversal number of regular graphs . Sci. China A: Math. , 51 ( 5 ) : 851 – 863 .
  • Tuza , Zs. 1990 . Covering all cliques of a graph . Discrete Math. , 86 : 117 – 126 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.