This article is cited in 1 scientific paper (total in 1 paper)
Graph reduction in the construction of minimal clique cover
P. V. Roldugin
Moscow State Technical University of Radio Engineering, Electronics and Automatics, Moscow
The problem of construction of a graph coverage with a minimum number of its complete subgraphs (cliques) is considered. We describe classes of subgraphs for which it is possible to reduce the graph coverage problem to the same problem for graphs of smaller orders. We show that these classes are wider than those known before.
classes of graphs, graph coverings, cliques.
PDF file (221 kB)
P. V. Roldugin, “Graph reduction in the construction of minimal clique cover”, Mat. Vopr. Kriptogr., 3:3 (2012), 105–128
Citation in format AMSBIB
\paper Graph reduction in the construction of minimal clique cover
\jour Mat. Vopr. Kriptogr.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
I. A. Badekha, P. V. Roldugin, “Density of graphs in which each edge is contained in at least two maximal cliques”, Discrete Math. Appl., 24:1 (2014), 1–12
|Number of views:|