\(r\)-dominating cliques in graphs with hypertree structure
From MaRDI portal
Publication:1356657
DOI10.1016/0012-365X(95)00277-4zbMath0870.05038MaRDI QIDQ1356657
Andreas Brandstädt, Feodor F. Dragan
Publication date: 7 July 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
On neighborhood-Helly graphs ⋮ Duchet-type theorems for powers of HHD-free graphs ⋮ Helly-gap of a graph and vertex eccentricities ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ Partitioning chordal graphs into independent sets and cliques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination, independent domination, and duality in strongly chordal graphs
- Weakly triangulated graphs
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- On domination problems for permutation and other graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- Topics on domination
- Hypergraphes arbores
- Dominating cliques in chordal graphs
- Domination in quadrangle-free Helly graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Convexity in Graphs and Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Clique Graphs of Chordal and Path Graphs
- Doubly chordal graphs, steiner trees, and connected domination
This page was built for publication: \(r\)-dominating cliques in graphs with hypertree structure
