On neighborhood-Helly graphs

DOI10.1016/j.dam.2016.04.029zbMath1350.05167OpenAlexW2475227852MaRDI QIDQ344856

Marina Groshaus, Min Chih Lin, Jayme Luiz Szwarcfiter

Publication date: 24 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.029

zbMATH Keywords

complexityextensionsNP-hardnessHelly property

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (05C99) Helly-type theorems and geometric transversal theory (52A35)

Related Items (1)

Helly-gap of a graph and vertex eccentricities

Cites Work

• Linear-time recognition of Helly circular-arc models and graphs
• Absolute reflexive retracts and absolute bipartite retracts
• The edge intersection graphs of paths in a tree
• Clique graphs and Helly graphs
• Diamond-free circle graphs are Helly circle
• Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
• Dismantling absolute retracts of reflexive graphs
• Efficient characterizations of \(n\)-chromatic absolute retracts
• Hypergraphes arbores
• \(r\)-dominating cliques in graphs with hypertree structure
• Domination in quadrangle-free Helly graphs
• A polynomial algorithm for the strong Helly property
• Normal Helly circular-arc graphs and its subclasses
• Complexity aspects of the Helly property: graphs and hypergraphs
• Faster recognition of clique-Helly and hereditary clique-Helly graphs
• Biclique-Helly graphs
• Algorithms on circular-arc graphs
• Dually Chordal Graphs
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Biclique graphs and biclique matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On neighborhood-Helly graphs