On the strong p-Helly property

DOI10.1016/J.DAM.2007.05.047zbMATH Open1140.05046OpenAlexW2155315459MaRDI QIDQ2482102FDOQ2482102

Authors: Mitre C. Dourado, Fábio Protti, Jayme L. Szwarcfiter 

Publication date: 16 April 2008

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

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

Recommendations

• On the generalized Helly property of hypergraphs, cliques, and bicliques
• Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
• scientific article; zbMATH DE number 2096437
• On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
• Characterization and recognition of generalized clique-Helly graphs

zbMATH Keywords

hereditary clique-Helly graphscomputationally complexitystrong Helly-property

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)

Cites Work

• On cliques in graphs
• The edge intersection graphs of paths in a tree
• Induced matchings
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial algorithm for the strong Helly property
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity aspects of generalized Helly hypergraphs
• Graph-Theoretic Concepts in Computer Science

Cited In (14)

• The Helly property on subfamilies of limited size
• On the generalized Helly property of hypergraphs, cliques, and bicliques
• Complexity aspects of generalized Helly hypergraphs
• A superclass of edge-path-tree graphs with few cliques
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient algorithm for Helly property recognition in a linear hypergraph
• Title not available (Why is that?)
• On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
• Title not available (Why is that?)
• The colorful Helly property for hypergraphs
• Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
• The problem of determining the Helly dimension of a graph
• On Helly hypergraphs with variable intersection sizes.

This page was built for publication: On the strong \(p\)-Helly property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482102)