Faster recognition of clique-Helly and hereditary clique-Helly graphs
DOI10.1016/j.ipl.2007.02.017zbMath1183.05059OpenAlexW2025463213MaRDI QIDQ2379939
Min Chih Lin, Jayme Luiz Szwarcfiter
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.017
algorithmsHelly propertyclique-Helly graphshereditary clique-Helly graphsdisk-Helly graphshereditary disk-Helly graphs
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique graphs and Helly graphs
- Dismantling absolute retracts of reflexive graphs
- A hierarchy of self-clique graphs
- Vertex-to-vertex pursuit in a graph
- A polynomial algorithm for the strong Helly property
- A characterization of clique graphs
- Über iterierte Clique-Graphen
- Graph Classes: A Survey
- Self‐clique graphs and matrix permutations
- A partial characterization of clique graphs
This page was built for publication: Faster recognition of clique-Helly and hereditary clique-Helly graphs