On cliques in graphs

1965/03/01 by J. W. Moon, L. Moser, Leo Moser · 32 citations
Mathematics · Computer Science · #Graph theory and applications #Graph Labeling and Dimension Problems #Advanced Graph Theory Research

paper · doi:10.1007/bf02760024

Cited by

• Exact generalized Turán number of vertex-disjoint paths of length two
• Hitting all maximal independent sets in c-hollow graphs
• A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
• Applications of Common Information to Computing Functions
• Predicting Magic from Very Few Measurements
• On the number of maximal independent sets and maximal induced bipartite subgraphs in K₄-free graphs
• Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
• On the Hypergraph Nash-Williams' Conjecture
• Aggregating maximal cliques in real-world graphs
• Asymptotic enumeration via graph containers and entropy
• Facet numbers of non-centrally symmetric reflexive polytopes arising from posets
• Complement reducible graphs
• Engineering Algorithms for ℓ-Isolated Maximal Clique Enumeration
• From independent sets and vertex colorings to isotropic spaces and\n isotropic decompositions
• Parameterized Algorithms for Finding Square Roots
• The number of maximal sum-free subsets of integers
• Enumeration and Maximum Number of Minimal Connected Vertex Covers in\n Graphs
• On cliques in hypergraphs
• Connecting Terminals and 2-Disjoint Connected Subgraphs
• On the distinct maximal-clique sizes in 3-uniform hypergraphs
• Spectrum Bandit Optimization
• Infinitely many groups exhibiting intermediate growth in maximal sum-free sets
• The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable
• Vertex Covers Revisited: Indirect Certificates and FPT Algorithms
• Efficient Large-Scale Multiple Migration Planning and Scheduling in SDN-enabled Edge Computing
• Coverings, Matchings and the number of maximal independent sets of graphs
• The Effect of Scheduling on Link Capacity in Multi-hopWireless Networks
• A Branch-and-Reduce Algorithm for Finding a Minimum Independent\n Dominating Set
• Enumerating Minimal Connected Dominating Sets
• Enumerating k-Vertex Connected Components in Large Graphs
• Counting maximal antichains and independent sets
• Two extremal problems in the light of Lex graphs