Faster recognition of clique-Helly and hereditary clique-Helly graphs
DOI10.1016/J.IPL.2007.02.017zbMATH Open1183.05059OpenAlexW2025463213MaRDI QIDQ2379939FDOQ2379939
Authors: Min Chih Lin, Jayme L. 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
Recommendations
- Publication:4940014
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- Graph-Theoretic Concepts in Computer Science
- Characterization and recognition of generalized clique-Helly graphs
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- scientific article; zbMATH DE number 553916
- Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
- Recognizing Helly edge-path-tree graphs and their clique graphs
- A note on the speed of hereditary graph properties
- Clique-width and the speed of hereditary properties
algorithmsHelly propertyclique-Helly graphsdisk-Helly graphshereditary clique-Helly graphshereditary disk-Helly graphs
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Graph Classes: A Survey
- A hierarchy of self-clique graphs
- Vertex-to-vertex pursuit in a graph
- Über iterierte Clique-Graphen
- Self‐clique graphs and matrix permutations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clique graphs and Helly graphs
- A partial characterization of clique graphs
- Title not available (Why is that?)
- A characterization of clique graphs
- Dismantling absolute retracts of reflexive graphs
- A polynomial algorithm for the strong Helly property
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- On the clique behavior and Hellyness of the complements of regular graphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- Title not available (Why is that?)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Clique planar graphs
- Biclique-Helly graphs
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- A story of diameter, radius, and (almost) Helly property
- Title not available (Why is that?)
- Cliques and extended triangles. A necessary condition for planar clique graphs
- On edge-sets of bicliques in graphs
- Two infinite families of critical clique-Helly graphs
- Recognizing Helly edge-path-tree graphs and their clique graphs
- The chromatic gap and its extremes
- Helly-gap of a graph and vertex eccentricities
- On neighborhood-Helly graphs
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- Beyond Helly graphs: the diameter problem on absolute retracts
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Distance problems within Helly graphs and \(k\)-Helly graphs
- On hereditary Helly classes of graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Characterization and recognition of generalized clique-Helly graphs
This page was built for publication: Faster recognition of clique-Helly and hereditary clique-Helly graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379939)
