Dominating cliques in graphs
From MaRDI portal
Publication:5925264
DOI10.1016/0012-365X(90)90353-JzbMath0722.05040OpenAlexW1985573889MaRDI QIDQ5925264
Margaret B. Cozzens, Laura L. Kelleher
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
Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)
Related Items (17)
A new characterization of \(P_k\)-free graphs ⋮ Dominating sets in social network graphs ⋮ Minimal asymmetric graphs ⋮ Domination on hyperbolic graphs ⋮ Unnamed Item ⋮ On dominating sets whose induced subgraphs have a bounded diameter ⋮ Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs ⋮ An exact algorithm for the minimum dominating clique problem ⋮ Algorithms for dominating clique problems ⋮ Unnamed Item ⋮ Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs ⋮ New results on connected dominating structures in graphs ⋮ Semicomplete absorbent sets in digraphs ⋮ A proof of a conjecture on the connected domination number ⋮ A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree ⋮ Domination, coloring and stability in \(P_5\)-reducible graphs ⋮ On connected dominating sets of restricted diameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dominating sets for split and bipartite graphs
- Dominating sets in social network graphs
- A linear algorithm for the domination number of a tree
- Optimum domination in weighted trees
- The Complexity of the Partial Order Dimension Problem
- Total domination in graphs
- Sufficient Conditions for Graphs to Have Threshold Number 2
- Dominating Sets in Chordal Graphs
- Towards a theory of domination in graphs
- A Note on "The Comparability Graph of a Tree"
This page was built for publication: Dominating cliques in graphs
