1 |
T. Andreae, On the clique-transversal number of chordal graphs, Discrete Math. 191 (1998), no. 1-3, 3-11.
DOI
ScienceOn
|
2 |
T. Andreae, M. Schughart, and Zs. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Math. 88 (1991), no. 1, 11-20.
DOI
ScienceOn
|
3 |
S. Aparna Lakshmanan and A. Vijayakumar, The (t)-property of some classes of graphs, Discrete Math. 309 (2009), no. 1, 259-263.
DOI
ScienceOn
|
4 |
G. Bacso and Zs. Tuza, Clique-transversal sets and weak 2-colorings in graphs of small maximum degree, Discrete Math. Theor. Comput. Sci. 11 (2009), no. 2, 15-24.
|
5 |
C. Berge, Hypergraphs, Amsterdam: North-Holland, 1989.
|
6 |
T. Biedl, E. D. Demaine, C. A. Duncan, R. Fleischer, and S. G. Kobourov, Tight bounds on maximal and maximum matchings, Discrete Math. 285 (2004), no. 1-3, 7-15.
DOI
ScienceOn
|
7 |
J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, 2008.
|
8 |
P. Erdos, T. Gallai, and Zs. Tuza, Covering the cliques of a graph with vertices, Discrete Math. 108 (1992), no. 1-3, 279-289.
DOI
ScienceOn
|
9 |
T. Gallai, Uber extreme Punkt-und Kantenmengen, Ann. Univ. Sci. Budapest. Eotvos Sect. Math. 2 (1959), 133-138.
|
10 |
A. M. Hobbs and E. Schmeichel, On the maximum number of independent edges in cubic graphs, Discrete Math. 42 (1982), no. 2-3, 317-320.
DOI
ScienceOn
|
11 |
E. F. Shan, T. C. E. Cheng, and L. Y. Kang, Bounds on the clique-transversal number of regular graphs, Sci. China Ser. A 51 (2008), no. 5, 851-863.
DOI
ScienceOn
|
12 |
O. Suil and D. B. West, Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree, J. Graph Theory 64 (2010), no. 2, 116-131.
DOI
|
13 |
W. T. Tutte, Connectivity in Graphs, University of Toronto Press, Toronto, 1966.
|
14 |
Zs. Tuza, Covering all cliques of a graph, Discrete Math. 86 (1990), no. 1-3, 117-126.
DOI
ScienceOn
|