On the hereditary (p,q)-Helly property of hypergraphs, cliques, and bicliques
DOI10.1016/J.ENDM.2015.07.060zbMATH Open1347.05124OpenAlexW2207940932MaRDI QIDQ324846FDOQ324846
Authors: Mitre C. Dourado, Luciano N. Grippo, Martín D. Safe 
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.060
Recommendations
recognition algorithms\((p,q)\)-Helly propertyforbidden induced subgraphsforbidden partial subhypergraphsmaximal bicliquesmaximal cliques
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Hypergraphs (05C65) Helly-type theorems and geometric transversal theory (52A35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The edge intersection graphs of paths in a tree
- Title not available (Why is that?)
- Extremal bi-Helly families
- Characterization and recognition of generalized clique-Helly graphs
- On the strong \(p\)-Helly property
- On hereditary Helly classes of graphs
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
Cited In (8)
- On the strong \(p\)-Helly property
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- Title not available (Why is that?)
- Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
- Graph-Theoretic Concepts in Computer Science
- On hereditary Helly classes of graphs
This page was built for publication: On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324846)
