On cliques in graphs - MaRDI portal

Cites work

On the theory of graphs

Cited in

(only showing first 100 items - show all)

On Independent Sets and Bicliques in Graphs
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
The number of maximal sum-free subsets of integers
Constraints on the number of maximal independent sets in graphs
The Number of Maximal Independent Sets in a Tree
Indeterminate strings, prefix arrays \& undirected graphs
Counting dominating sets and related structures in graphs
Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function
The number of maximal independent sets in a connected graph
A note on the problem of reporting maximal cliques
On the minimum feedback vertex set problem: Exact and enumeration algorithms
On two techniques of combining branching and treewidth
Posets with maximal Möbius function
Minimal dominating sets in interval graphs and trees
On the strong \(p\)-Helly property
On the number of maximum independent sets of graphs
On the maximum number of maximum independent sets in connected graphs
Cliques of a graph-variations on the Bron-Kerbosch algorithm
On the number of minimal transversals in 3-uniform hypergraphs
Extremal problems related to Betti numbers of flag complexes
Enumeration of minimal connected dominating sets for chordal graphs
Enumerating minimal connected dominating sets in graphs of bounded chordality
Feedback vertex sets in tournaments
Graphs, partitions and Fibonacci numbers
The minimal \(k\)-core problem for modeling \(k\)-assemblies
The maximal number of induced complete bipartite graphs
Iterative compression and exact algorithms
Independent sets in graphs
New parameterized algorithms for the edge dominating set problem
Finding kernels or solving SAT
Optimal simulation of self-verifying automata by deterministic automata
Exact Algorithms for Edge Domination
Trimmed Moebius inversion and graphs of bounded degree
Exact algorithms for exact satisfiability and number of perfect matchings
Extremal edge polytopes
Enumerating maximal independent sets with applications to graph colouring.
Efficiency in exponential time for domination-type problems
On planar Toeplitz graphs
On the number of minimal separators in graphs
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
Problems on cycles and colorings
On the maximum number of maximum independent sets
k-Blocks and Ultrablocks in Graphs
Counting maximal antichains and independent sets
Maximal independent sets in the covering graph of the cube
Combinatorial algorithms for the maximum \(k\)-plex problem
Graphs with the second largest number of maximal independent sets
The worst-case time complexity for generating all maximal cliques and computational experiments
On the maximum number of cliques in a graph
Steiner's problem in graphs and its implications
Graph with given achromatic number
A finiteness theorem for maximal independent sets
Subset feedback vertex sets in chordal graphs
Efficient domination of the orientations of a graph
Trees with maximum number of maximal matchings
Counting and enumerating independent sets with applications to combinatorial optimization problems
On independent sets and bicliques in graphs
The maximum clique problem
Constructing test functions for global optimization using continuous formulations of graph problems
On the number of minimal dominating sets on some graph classes
The maximum number of cliques in dense graphs
A sharp bound on the number of maximal sum-free sets
The number of independent sets in unicyclic graphs
The maximal number of induced \(r\)-partite subgraphs
Hypergraph containers
On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
Efficiently enumerating all maximal cliques with bit-parallelism
Parameterized algorithms for finding square roots
On graphs with polynomially solvable maximum-weight clique problem
Complement reducible graphs
An upper bound for the number of maximal independent sets in a graph
Clique-detection models in computational biochemistry and genomics
Open problems in abstract argumentation
The typical structure of maximal triangle-free graphs
An exact algorithm for the minimum dominating clique problem
jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology
Isometric embeddings in Hamming graphs
On cliques in graphs
Clique problem, cutting plane proofs and communication complexity
Bounding the feedback vertex number of digraphs in terms of vertex degrees
Large Induced Subgraphs via Triangulations and CMSO
Enumerating all connected maximal common subgraphs in two graphs
The number of maximal independent sets in connected triangle-free graphs
Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
A new decomposition technique for maximal clique enumeration for sparse graphs
Almost all digraphs have a kernel
The second largest number of maximal independent sets in connected graphs with at most one cycle
Minimum matrix representation of closure operations
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets
Maximal independent sets in clique-free graphs
On the number of \(k\)-dominating independent sets
On the computation of fixed points in Boolean networks
Iterative Compression and Exact Algorithms
Extension of some edge graph problems: standard, parameterized and approximation complexity
On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s
Minimum cost edge blocker clique problem
The complexity of simple models -- a study of worst and typical hard cases for the standard quadratic optimization problem
Isolation concepts for clique enumeration: comparison and computational experiments
A new backtracking algorithm for generating the family of maximal independent sets of a graph

This page was built for publication: On cliques in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920767)