Graph-Theoretic Concepts in Computer Science

DOI10.1007/B104584MaRDI QIDQ5710815zbMATH OpenOpenAlexFDO

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

Publication date 8 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

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

Cited in

(10)

• Characterization and recognition of generalized clique-Helly graphs
• On the strong \(p\)-Helly property
• On the clique behavior and Hellyness of the complements of regular graphs
• The Helly property on subfamilies of limited size
• scientific article; zbMATH DE number 1409177 (Why is no real title available?)
• Faster recognition of clique-Helly and hereditary clique-Helly graphs
• On the generalized Helly property of hypergraphs, cliques, and bicliques
• Complexity aspects of generalized Helly hypergraphs
• Optimal guard sets and the Helly property
• On the hereditary (p,q)-Helly property of hypergraphs, cliques, and bicliques

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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