Domination in quadrangle-free Helly graphs

DOI10.1007/BF01130088zbMath0816.05039OpenAlexW4245586123MaRDI QIDQ1842416

Feodor F. Dragan

Publication date: 17 May 1995

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01130088

zbMATH Keywords

quadranglespolynomial-time solvabilitybridged graphsHelly graphs\(r\)-domination problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Obstructions to a small hyperbolicity in Helly graphs ⋮ \(r\)-dominating cliques in graphs with hypertree structure ⋮ On neighborhood-Helly graphs ⋮ 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 ⋮ An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph ⋮ A polynomial algorithm for the strong Helly property

Cites Work

• Optimal experimental designs in minimax estimation problems. I
• Sufficient conditions for extremum, penalty functions and regularity
• Unnamed Item
• Unnamed Item

This page was built for publication: Domination in quadrangle-free Helly graphs