- 1 Augustson, J.G., and Minker, J. An analysis of some graph theoretical cluster techniques, J. ACM 17 (1970), 571-588. Google ScholarDigital Library
- 2 Bierstone, E. Unpublished report. U of Toronto.Google Scholar
- 3 Bron, C., Kerbosch, J.A.G.M., and Schell, H.J. Finding cliques in an undirected graph. Tech. Rep. Technological U. of Eindhoven, The Netherlands.Google Scholar
- 4 Little, John D.C., et al. An algorithm for the traveling salesman problem. Oper. Res. 11 (1963), 972-989.Google ScholarDigital Library
- 5 Moon, J.W., and Moser, L. On cliques in graphs. Israel J. Math. 3 (1965), 23-28.Google ScholarCross Ref
- 6 Mulligan, G.D., and Corneil, D.G. Corrections to Bierstone's algorithm for generating cliques. J. ACM 19 (Apr. 1972), 244-247. Google ScholarDigital Library
Recommendations
Cliques in the union of graphs
Let B and R be two simple graphs with vertex set V, and let G ( B , R ) be the simple graph with vertex set V, in which two vertices are adjacent if they are adjacent in at least one of B and R. For X V , we denote by B | X the subgraph of B induced by ...
Extremal graphs for intersecting cliques
For any two positive integers n r 1, the well-known Turán Theorem states that there exists a least positive integer ex(n,Kr) such that every graph with n vertices and ex(n,Kr)+1 edges contains a subgraph isomorphic to Kr. We determine the minimum number ...
On the Maximum Number of Cliques in a Graph
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-...
Comments