Characterization and recognition of generalized clique-Helly graphs
DOI10.1016/J.DAM.2007.06.013zbMATH Open1143.05071OpenAlexW1979845124MaRDI QIDQ2462382FDOQ2462382
Authors: Mitre C. Dourado, Fábio Protti, Jayme L. Szwarcfiter 
Publication date: 30 November 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.06.013
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cites Work
- Graph Classes: A Survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- The edge intersection graphs of paths in a tree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal bi-Helly families
- Title not available (Why is that?)
- Clique-inverse graphs ofK3-free andK4-free graphs
- Title not available (Why is that?)
- Eduard Helly (1884-1943), in memoriam
- Duality and perfection for edges in cliques
- Graph-Theoretic Concepts in Computer Science
Cited In (9)
- On the strong \(p\)-Helly property
- On the clique behavior and Hellyness of the complements of regular graphs
- Title not available (Why is that?)
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- On \(H\)-topological intersection graphs
- Optimal guard sets and the Helly property
- On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Characterization and recognition of generalized clique-Helly graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2462382)
