Dominating cliques in graphs

DOI10.1016/0012-365X(90)90353-JMaRDI QIDQ5896554zbMATH OpenOpenAlexFDO

Authors M. 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

zbMATH Keywords

forbidden subgraphdominating clique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• Dominating cliques in graphs
• Dominating cliques in \(P_ 5\)-free graphs
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
• scientific article; zbMATH DE number 2188424
• Dominating sets with small clique covering number

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 4055676 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (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
• Parallel concepts in graph theory
• 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
• `` Strong NP-Completeness Results

Cited in

(29)

• scientific article; zbMATH DE number 1185594 (Why is no real title available?)
• Dominating cliques in chordal graphs
• Characterization of \(P_{6}\)-free graphs
• Dominating cliques in graphs
• On the existence of total dominating subgraphs with a prescribed additive hereditary property
• On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
• Clustering and domination in perfect graphs
• Complete description of forbidden subgraphs in the structural domination problem
• Dominating cliques in \(P_ 5\)-free graphs
• On identifying dominant cliques.
• Domination properties and induced subgraphs
• Characterization of graphs dominated by induced paths
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
• \(H\)-domination in graphs
• Clique independence, domination and irredundance in graphs
• New results on connected dominating structures in graphs
• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
• Infinite versus finite graph domination
• On the problem of domino recognition
• scientific article; zbMATH DE number 4204394 (Why is no real title available?)
• A new characterization of \(P_{6}\)-free graphs
• Minimum partition of an independence system into independent sets
• A detailed study of the dominating cliques phase transition in random graphs
• Hereditarily dominated graphs
• Algorithmic aspects of semitotal domination in graphs
• Uniform clutters and dominating sets of graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Dominating subgraphs in graphs with some forbidden structures
• The parametric complexity of graph diameter augmentation

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)