On the generalized Helly property of hypergraphs, cliques, and bicliques

DOI10.1016/j.dam.2023.01.006OpenAlexW4317493987MaRDI QIDQ2689646

Martín D. Safe, Mitre C. Dourado, Luciano N. Grippo

Publication date: 13 March 2023

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

Full work available at URL: https://arxiv.org/abs/2201.12610

zbMATH Keywords

maximal cliquesforbidden induced subgraphsrecognition algorithmsforbidden partial subhypergraphsmaximal bicliquesHelly hypergraphsgeneralized Helly property

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the clique behavior and Hellyness of the complements of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
• Duality and perfection for edges in cliques
• A simplified NP-complete satisfiability problem
• The edge intersection graphs of paths in a tree
• Complexity aspects of generalized Helly hypergraphs
• Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
• A polynomial algorithm for the strong Helly property
• Complexity aspects of the Helly property: graphs and hypergraphs
• Extremal bi-Helly families
• Faster recognition of clique-Helly and hereditary clique-Helly graphs
• Characterization and recognition of generalized clique-Helly graphs
• Biclique-Helly graphs
• On the strong \(p\)-Helly property
• Arboricity and Subgraph Listing Algorithms
• Reducibility among Combinatorial Problems

This page was built for publication: On the generalized Helly property of hypergraphs, cliques, and bicliques