\(r\)-dominating cliques in graphs with hypertree structure
type: Item
instance of: scholarly article
title: \(r\)-dominating cliques in graphs with hypertree structure
zbMATH Open document ID: 0870.05038
DOI: 10.1016/0012-365X(95)00277-4
author: Feodor F. Dragan
author: Andreas Brandstädt
published in: Discrete Mathematics
publication date: 1997-07-07T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1019023
zbMATH Keywords: \(r\)-dominating cliques
zbMATH Keywords: Helly graphs
zbMATH Keywords: chordal graphs
zbMATH Keywords: \(r\)-dominating set
zbMATH Keywords: linear-time algorithm
MaRDI profile type: Publication
cites work: Q4099676
cites work: On domination problems for permutation and other graphs
cites work: Labeling algorithms for domination problems in sun-free chordal graphs
cites work: The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
cites work: Q4034774
cites work: Q4318220
cites work: Domination in quadrangle-free Helly graphs
cites work: Q4272121
cites work: Q4200096
cites work: Domination, independent domination, and duality in strongly chordal graphs
cites work: Convexity in Graphs and Hypergraphs
cites work: Hypergraphes arbores
cites work: Q3328583
cites work: Weakly triangulated graphs
cites work: Topics on domination
cites work: Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
cites work: Dominating cliques in chordal graphs
cites work: Doubly chordal graphs, steiner trees, and connected domination
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Clique Graphs of Chordal and Path Graphs
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Q3691771
description: scientific article; zbMATH DE number 1019023