Dominating cliques in graphs
From MaRDI portal
Publication:5925264
Recommendations
- Dominating cliques in graphs
- Dominating cliques in chordal graphs
- Domination using induced cliques in graphs
- Clique domination in graphs.
- Dominating cliques in distance-hereditary graphs
- Clustering and domination in perfect graphs
- On cliques in graphs
- Algorithms for dominating clique problems
- scientific article; zbMATH DE number 1185594
- Domination in graphs
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- scientific article; zbMATH DE number 3910441 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A Note on "The Comparability Graph of a Tree"
- A linear algorithm for the domination number of a tree
- Dominating Sets in Chordal Graphs
- Dominating sets for split and bipartite graphs
- Dominating sets in social network graphs
- Optimum domination in weighted trees
- Sufficient Conditions for Graphs to Have Threshold Number 2
- The Complexity of the Partial Order Dimension Problem
- Total domination in graphs
- Towards a theory of domination in graphs
Cited in
(30)- Dominating cliques in chordal graphs
- On identifying dominant cliques.
- Semicomplete absorbent sets in digraphs
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- A study of an undirected graph on a finite subset of natural numbers
- Minimal asymmetric graphs
- Uniform clutters and dominating sets of graphs
- Domination, coloring and stability in \(P_5\)-reducible graphs
- Clustering and domination in perfect graphs
- New results on connected dominating structures in graphs
- A new characterization of P_k-free graphs
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
- Algorithms for dominating clique problems
- On dominating sets whose induced subgraphs have a bounded diameter
- -boundedness and related problems on graphs without long induced paths: a survey
- A proof of a conjecture on the connected domination number
- On connected dominating sets of restricted diameter
- Clique independence, domination and irredundance in graphs
- Exact algorithms for dominating clique problems (extended abstract)
- An exact algorithm for the minimum dominating clique problem
- scientific article; zbMATH DE number 1185594 (Why is no real title available?)
- Finding minimum clique capacity
- Clique domination in graphs.
- Exact and parameterized algorithms for the independent cutset problem
- Dominating sets in social network graphs
- A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree
- A detailed study of the dominating cliques phase transition in random graphs
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- Domination on hyperbolic graphs
- scientific article; zbMATH DE number 7527867 (Why is no real title available?)
This page was built for publication: Dominating cliques in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925264)
