Dominating cliques in chordal graphs

DOI10.1016/0012-365X(94)90118-XzbMath0796.05052MaRDI QIDQ1322189

Peter Damaschke, Dieter Kratsch, Anna Lubiw

Publication date: 15 September 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cyclediameterchordal graphdominating setchordstrongly chordal graphdominating clique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (12)

Dominating cliques in distance-hereditary graphs ⋮ r-Domination problems on homogeneously orderable graphs ⋮ \(r\)-dominating cliques in graphs with hypertree structure ⋮ A note on \(r\)-dominating cliques ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ Diametral path graphs ⋮ Unnamed Item ⋮ On dominating sets whose induced subgraphs have a bounded diameter ⋮ Stable structure on safe set problems in vertex-weighted graphs ⋮ Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs ⋮ Maximum rooted connected expansion ⋮ Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs

Cites Work

• Domination, independent domination, and duality in strongly chordal graphs
• Introduction to ``Topics on Domination
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
• Characterizations of strongly chordal graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On the Algorithmic Complexity of Total Domination
• Doubly Lexical Orderings of Matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: Dominating cliques in chordal graphs