Characterization and recognition of generalized clique-Helly graphs
From MaRDI portal
Publication:2462382
DOI10.1016/j.dam.2007.06.013zbMath1143.05071MaRDI QIDQ2462382
Fábio Protti, Mitre C. Dourado, Jayme Luiz 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
05C75: Structural characterization of families of graphs
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Cites Work
- Duality and perfection for edges in cliques
- The edge intersection graphs of paths in a tree
- Eduard Helly (1884-1943), in memoriam
- Extremal bi-Helly families
- Graph Classes: A Survey
- The complexity of theorem-proving procedures
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item