The following pages link to On cliques in graphs (Q5920767):
Displaying 50 items.
- Parameterized algorithms for finding square roots (Q262249) (← links)
- Counting dominating sets and related structures in graphs (Q271644) (← links)
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology (Q281275) (← links)
- The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
- A sharp bound on the number of maximal sum-free sets (Q322191) (← links)
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics (Q334820) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- On planar Toeplitz graphs (Q367045) (← links)
- Problems on cycles and colorings (Q383772) (← links)
- Maximal independent sets in the covering graph of the cube (Q385145) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Extremal problems related to Betti numbers of flag complexes (Q400490) (← links)
- Extremal edge polytopes (Q405274) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- Hypergraph containers (Q496210) (← links)
- Independent sets in graphs (Q501998) (← links)
- Enumerating solution-free sets in the integers (Q509275) (← links)
- Bounding the feedback vertex number of digraphs in terms of vertex degrees (Q534359) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- On the third largest number of maximal independent sets of graphs (Q726518) (← links)
- Optimal state reductions of automata with partially specified behaviors (Q728283) (← links)
- On critical subgraphs of colour-critical graphs (Q759160) (← links)
- Maximal independent sets in caterpillar graphs (Q765369) (← links)
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- Trees with maximum number of maximal matchings (Q878628) (← links)
- Refined pivot selection for maximal clique enumeration in graphs (Q899307) (← links)
- On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s (Q906424) (← links)
- Almost all digraphs have a kernel (Q915737) (← links)
- The maximum number of maximal independent sets in unicyclic connected graphs (Q932626) (← links)
- On the number of minimal transversals in 3-uniform hypergraphs (Q932689) (← links)
- A note on the problem of reporting maximal cliques (Q955035) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
- On graphs with the third largest number of maximal independent sets (Q976086) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
