On cliques in graphs

DOI10.1007/BF02760024zbMath0144.23205OpenAlexW2013568176WikidataQ55872310 ScholiaQ55872310MaRDI QIDQ5920767

John W. Moon

Publication date: 1965

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02760024

zbMATH Keywords

topology

Related Items (only showing first 100 items - show all)

An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 ⋮ Counting dominating sets and related structures in graphs ⋮ Enumerating minimal connected dominating sets in graphs of bounded chordality ⋮ Minimum cost edge blocker clique problem ⋮ jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology ⋮ The minimal \(k\)-core problem for modeling \(k\)-assemblies ⋮ On the number of connected sets in bounded degree graphs ⋮ The maximal number of induced complete bipartite graphs ⋮ A bijection between cliques in graphs and factorizations in free monoids ⋮ Exact algorithms for the minimum cost vertex blocker clique problem ⋮ Another extremal problem for Turan graphs ⋮ Blocker size via matching minors ⋮ A sharp bound on the number of maximal sum-free sets ⋮ Computing maximal subsemigroups of a finite semigroup ⋮ On rejected arguments and implicit conflicts: the hidden power of argumentation semantics ⋮ The number of maximal independent sets in a connected graph ⋮ Efficiently enumerating all maximal cliques with bit-parallelism ⋮ The worst-case time complexity for generating all maximal cliques and computational experiments ⋮ Minimal dominating sets in interval graphs and trees ⋮ Isometric embeddings in Hamming graphs ⋮ Maximal independent sets in graphs with at most one cycle ⋮ Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function ⋮ On planar Toeplitz graphs ⋮ Efficient domination of the orientations of a graph ⋮ On comparing algorithms for the maximum clique problem ⋮ Homothetic polygons and beyond: maximal cliques in intersection graphs ⋮ Trees with maximum number of maximal matchings ⋮ Problems on cycles and colorings ⋮ Enumeration and maximum number of minimal connected vertex covers in graphs ⋮ Maximal independent sets in the covering graph of the cube ⋮ Minimal dominating sets in graph classes: combinatorial bounds and enumeration ⋮ New parameterized algorithms for the edge dominating set problem ⋮ Extremal problems related to Betti numbers of flag complexes ⋮ Extremal edge polytopes ⋮ Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets ⋮ Clique detection for nondirected graphs: Two new algorithms ⋮ Inductive synthesis of cover-grammars with the help of ant colony optimization ⋮ Finding kernels or solving SAT ⋮ Refined pivot selection for maximal clique enumeration in graphs ⋮ On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s ⋮ Complement reducible graphs ⋮ Ultrametricity indices for the Euclidean and Boolean hypercubes ⋮ Combinatorial algorithms for the maximum \(k\)-plex problem ⋮ Branch and recharge: exact algorithms for generalized domination ⋮ A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically ⋮ Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets ⋮ Almost all digraphs have a kernel ⋮ Clique problem, cutting plane proofs and communication complexity ⋮ Yet harder knapsack problems ⋮ On the number of minimal dominating sets on some graph classes ⋮ A refined exact algorithm for edge dominating set ⋮ The maximum number of maximal independent sets in unicyclic connected graphs ⋮ On the number of minimal transversals in 3-uniform hypergraphs ⋮ The chromatic uniqueness of complete bipartite graphs ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ Hypergraph containers ⋮ A new decomposition technique for maximal clique enumeration for sparse graphs ⋮ On detecting maximal quasi antagonistic communities in signed graphs ⋮ Independent sets in graphs ⋮ A two-level graph partitioning problem arising in mobile wireless communications ⋮ Enumerating solution-free sets in the integers ⋮ A note on the problem of reporting maximal cliques ⋮ Complexity of Grundy coloring and its variants ⋮ Dominant-set clustering: a review ⋮ Exact algorithms for exact satisfiability and number of perfect matchings ⋮ On the minimum feedback vertex set problem: Exact and enumeration algorithms ⋮ On the maximum number of maximum independent sets ⋮ Bounding the feedback vertex number of digraphs in terms of vertex degrees ⋮ Enumerating maximal independent sets with applications to graph colouring. ⋮ Theoretical underpinnings for maximal clique enumeration on perturbed graphs ⋮ Optimal simulation of self-verifying automata by deterministic automata ⋮ On graphs with the third largest number of maximal independent sets ⋮ On a problem of Katona on minimal separating systems ⋮ Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs ⋮ Graph with given achromatic number ⋮ On finding all unilaterally connected components of a digraph ⋮ Some properties of irreducible coverings by cliques of complete multipartite graphs ⋮ On the third largest number of maximal independent sets of graphs ⋮ On the maximum number of cliques in a graph ⋮ Optimal state reductions of automata with partially specified behaviors ⋮ Satisfiability of mixed Horn formulas ⋮ Graphs with the second largest number of maximal independent sets ⋮ k-Blocks and Ultrablocks in Graphs ⋮ Validity of clusters formed by graph-theoretic cluster methods ⋮ Efficiency in exponential time for domination-type problems ⋮ On two techniques of combining branching and treewidth ⋮ On critical subgraphs of colour-critical graphs ⋮ The number of independent sets in unicyclic graphs with a given diameter ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ Maximal independent sets in caterpillar graphs ⋮ Isolation concepts for clique enumeration: comparison and computational experiments ⋮ The number of maximal independent sets in connected triangle-free graphs ⋮ Trees with the second largest number of maximal independent sets ⋮ Counting and enumerating independent sets with applications to combinatorial optimization problems ⋮ A new backtracking algorithm for generating the family of maximal independent sets of a graph ⋮ Enumerating all connected maximal common subgraphs in two graphs ⋮ The maximum number of cliques in dense graphs ⋮ Minimum matrix representation of closure operations ⋮ The maximum clique problem ⋮ Parameterized algorithms for finding square roots

Cites Work

• On the theory of graphs

This page was built for publication: On cliques in graphs