Dominating cliques in graphs
From MaRDI portal
Publication:5896554
DOI10.1016/0012-365X(90)90353-JzbMATH Open0729.05043OpenAlexW1985573889MaRDI QIDQ5896554FDOQ5896554
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90353-j
Cites Work
- Title not available (Why is that?)
- Total domination in graphs
- Title not available (Why is that?)
- Parallel concepts in graph theory
- The Complexity of the Partial Order Dimension Problem
- Towards a theory of domination in graphs
- `` Strong NP-Completeness Results
- Dominating sets for split and bipartite graphs
- A linear algorithm for the domination number of a tree
- Dominating Sets in Chordal Graphs
- A Note on "The Comparability Graph of a Tree"
- Dominating sets in social network graphs
- Optimum domination in weighted trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sufficient Conditions for Graphs to Have Threshold Number 2
- Title not available (Why is that?)
Cited In (23)
- Dominating cliques in chordal graphs
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
- On identifying dominant cliques.
- Domination properties and induced subgraphs
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- Title not available (Why is that?)
- Infinite versus finite graph domination
- The parametric complexity of graph diameter augmentation
- Clustering and domination in perfect graphs
- Algorithmic aspects of semitotal domination in graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Complete description of forbidden subgraphs in the structural domination problem
- Characterization of graphs dominated by induced paths
- Dominating cliques in \(P_ 5\)-free graphs
- Dominating cliques in graphs
- Minimum partition of an independence system into independent sets
- Characterization of \(P_{6}\)-free graphs
- On the existence of total dominating subgraphs with a prescribed additive hereditary property
- A new characterization of \(P_{6}\)-free graphs
- Dominating subgraphs in graphs with some forbidden structures
- \(H\)-domination in graphs
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- Hereditarily dominated graphs
Recommendations
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 Q5896554)
