Covering all cliques of a graph
- 1 December 1990
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 86 (1-3) , 117-126
- https://doi.org/10.1016/0012-365x(90)90354-k
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Covering the cliques of a graph with verticesDiscrete Mathematics, 1992
- Clique-transversal sets of line graphs and complements of line graphsDiscrete Mathematics, 1991
- An upper bound for the transversal numbers of 4-uniform hypergraphsJournal of Combinatorial Theory, Series B, 1990
- Transversal numbers of uniform hypergraphsGraphs and Combinatorics, 1990
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961