On the public citation graph

Computational aspects of the Helly property: a survey

https://doi.org/10.1007/bf03192385

0 signed · 89 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118033104openalex-snapshot

Graphs: Theory and Algorithms

inferredcites →https://doi.org/10.1002/jgt.10496openalex-snapshot

Self‐clique graphs and matrix permutations

inferredcites →https://doi.org/10.1002/jgt.20126openalex-snapshot

Graph relations, clique divergence and surface triangulations

inferredcites →https://doi.org/10.1002/net.3230040407openalex-snapshot

Algorithms on circular‐arc graphs

inferredcites →https://doi.org/10.1006/gmip.1997.0437openalex-snapshot

Combinatorics and Image Processing

inferredcites →https://doi.org/10.1006/jagm.1995.1047openalex-snapshot

Graph Sandwich Problems

inferredcites →https://doi.org/10.1007/0-387-22444-0_5openalex-snapshot

A Survey on Clique Graphs

inferredcites →https://doi.org/10.1007/11415770_24openalex-snapshot

Graph Theoretical Insights into Evolution of Multidomain Proteins

inferredcites →https://doi.org/10.1007/11809678_10openalex-snapshot

Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs

inferredcites →https://doi.org/10.1007/11917496_24openalex-snapshot

Clique Graph Recognition Is NP-Complete

inferredcites →https://doi.org/10.1007/3-540-12727-5_3openalex-snapshot

Acyclic database schemes (of various degrees): A painless introduction

inferredcites →https://doi.org/10.1007/3-540-57182-5_19openalex-snapshot

Efficient type reconstruction in the presence of inheritance

inferredcites →https://doi.org/10.1007/978-1-349-16482-0_10openalex-snapshot

Problems and Exercises

inferredcites →https://doi.org/10.1007/978-3-540-30559-0_29openalex-snapshot

Characterization and Recognition of Generalized Clique-Helly Graphs

inferredcites →https://doi.org/10.1007/978-3-642-58043-7_8openalex-snapshot

Geometric Transversal Theory

inferredcites →https://doi.org/10.1007/bf01793007openalex-snapshot

On clique convergent graphs

inferredcites →https://doi.org/10.1007/bf02760024openalex-snapshot

On cliques in graphs

inferredcites →https://doi.org/10.1007/bf02992818openalex-snapshot

Über iterierte Clique-Graphen

inferredcites →https://doi.org/10.1007/bf03322499openalex-snapshot

Eduard Helly (1884–1943), in memoriam

inferredcites →https://doi.org/10.1007/bf03353003openalex-snapshot

A Family of Clique Divergent Graphs with Linear Growth

inferredcites →https://doi.org/10.1007/bfb0066181openalex-snapshot

Extremal problems on graphs and hypergraphs

inferredcites →https://doi.org/10.1007/s00373-007-0756-6openalex-snapshot

Biclique-Helly Graphs

inferredcites →https://doi.org/10.1007/s004930070035openalex-snapshot

Bicliques in Graphs I: Bounds on Their Number

inferredcites →https://doi.org/10.1016/0001-8708(92)90052-mopenalex-snapshot

Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem

inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot

Normal hypergraphs and the perfect graph conjecture

inferredcites →https://doi.org/10.1016/0012-365x(78)90154-1openalex-snapshot

Hypergraphes arbores

inferredcites →https://doi.org/10.1016/0095-8956(71)90070-0openalex-snapshot

A characterization of clique graphs

inferredcites →https://doi.org/10.1016/0095-8956(84)90035-2openalex-snapshot

Duality and perfection for edges in cliques

inferredcites →https://doi.org/10.1016/0095-8956(85)90088-7openalex-snapshot

The edge intersection graphs of paths in a tree

inferredcites →https://doi.org/10.1016/0095-8956(91)90051-kopenalex-snapshot

Efficient characterizations of n-chromatic absolute retracts

inferredcites →https://doi.org/10.1016/0097-3165(93)90068-jopenalex-snapshot

Helly property in finite set systems

inferredcites →https://doi.org/10.1016/0166-218x(93)90219-eopenalex-snapshot

Absolute reflexive retracts and absolute bipartite retracts

inferredcites →https://doi.org/10.1016/b978-0-444-89596-7.50017-1openalex-snapshot

Helly, Radon, and Carathéodory Type Theorems

inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot

Combinatorial Problems and Exercises

inferredcites →https://doi.org/10.1016/j.disc.2003.10.023openalex-snapshot

The clique operator on cographs and serial graphs

inferredcites →https://doi.org/10.1016/j.disc.2003.11.010openalex-snapshot

A hierarchy of self-clique graphs

inferredcites →https://doi.org/10.1016/j.disc.2006.01.016openalex-snapshot

Self-clique Helly circular-arc graphs

inferredcites →https://doi.org/10.1016/j.ejc.2008.05.005openalex-snapshot

On expansive graphs

inferredcites →https://doi.org/10.1016/j.endm.2005.05.014openalex-snapshot

Partial characterizations of clique-perfect graphs

inferredcites →https://doi.org/10.1016/j.endm.2005.06.093openalex-snapshot

Helly Property and Sandwich Graphs

inferredcites →https://doi.org/10.1016/j.ipl.2004.10.004openalex-snapshot

The Helly property on subfamilies of limited size

inferredcites →https://doi.org/10.1016/j.ipl.2006.02.007openalex-snapshot

Complexity aspects of generalized Helly hypergraphs

inferredcites →https://doi.org/10.1016/s0012-365x(02)00502-2openalex-snapshot

The icosahedron is clique divergent

inferredcites →https://doi.org/10.1016/s0012-365x(97)00085-xopenalex-snapshot

On clique-complete graphs

inferredcites →https://doi.org/10.1016/s0012-365x(99)00192-2openalex-snapshot

Extremal bi-Helly families

inferredcites →https://doi.org/10.1016/s0020-0190(01)00186-7openalex-snapshot

A polynomial algorithm for the strong Helly property

inferredcites →https://doi.org/10.1016/s0021-9800(68)80055-9openalex-snapshot

A partial characterization of clique graphs

inferredcites →https://doi.org/10.1016/s0166-218x(03)00369-xopenalex-snapshot

Cliques and extended triangles. A necessary condition for planar clique graphs

inferredcites →https://doi.org/10.1016/s0166-218x(03)00378-0openalex-snapshot

Clique divergent clockwork graphs and partial orders

inferredcites →https://doi.org/10.1016/s0166-218x(97)00125-xopenalex-snapshot

The algorithmic use of hypertree structure and maximum neighbourhood orderings

inferredcites →https://doi.org/10.1016/s0195-6698(83)80041-9openalex-snapshot

Ensemble Convexes dans les Graphes I

inferredcites →https://doi.org/10.1016/s0195-6698(84)80032-3openalex-snapshot

Helly-type Hypergraphs and Sperner Families

inferredcites →https://doi.org/10.1016/s0195-6698(89)80053-8openalex-snapshot

DismantlinG Absolute Retracts of Reflexive Graphs

inferredcites →https://doi.org/10.1016/s0304-0208(08)x7180-4openalex-snapshot

Planar Graphs: Theory and Algorithms

inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot

Annals of Discrete Mathematics

inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot

Graphs and Hypergraphs

inferredcites →https://doi.org/10.1089/cmb.2006.13.351openalex-snapshot

Graph Theoretical Insights into Evolution of Multidomain Proteins

inferredcites →https://doi.org/10.1090/chel/361openalex-snapshot

Combinatorial Problems and Exercises

inferredcites →https://doi.org/10.1090/fim/019openalex-snapshot

Efficient Graph Representations

inferredcites →https://doi.org/10.1090/pspum/007/0157289openalex-snapshot

Helly’s theorem and its relatives

inferredcites →https://doi.org/10.1109/tec.1959.5222697openalex-snapshot

Minimizing the Number of States in Incompletely Specified Sequential Switching Functions

inferredcites →https://doi.org/10.1137/0206036openalex-snapshot

A New Algorithm for Generating All the Maximal Independent Sets

inferredcites →https://doi.org/10.1137/1.9780898719796openalex-snapshot

Graph Classes: A Survey

inferredcites →https://doi.org/10.1137/1.9780898719802openalex-snapshot

Topics in Intersection Graph Theory

inferredcites →https://doi.org/10.1137/s0895480100376848openalex-snapshot

A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

inferredcites →https://doi.org/10.1137/s0895480191223191openalex-snapshot

Clique Graphs of Chordal and Path Graphs

inferredcites →https://doi.org/10.1137/s0895480193253415openalex-snapshot

Dually Chordal Graphs

inferredcites →https://doi.org/10.1145/160985.161000openalex-snapshot

Helly theorems and generalized linear programming

inferredcites →https://doi.org/10.1145/2402.322390openalex-snapshot

Degrees of acyclicity for hypergraphs and relational database schemes

inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot

The complexity of theorem-proving procedures

inferredcites →https://doi.org/10.1590/s0101-74382003000100016openalex-snapshot

On a conjecture concerning helly circle graphs

inferredcites →https://doi.org/10.1590/s0104-65002001000200007openalex-snapshot

On the helly defect of a graph

inferredcites →https://doi.org/10.2140/pjm.1981.96.115openalex-snapshot

Partition numbers for trees and ordered sets

inferredcites →https://doi.org/10.21711/231766362003/rmc258openalex-snapshot

Some new results on circle graphs

inferredcites →https://doi.org/10.4153/cmb-1978-058-5openalex-snapshot

A Characterization of Soft Hypergraphs

inferredcites →https://doi.org/10.61091/jcmccopenalex-snapshot

Journal of Combinatorial Mathematics and Combinatorial Computing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_25openalex-snapshot

FPT Algorithms for Consecutive Ones Submatrix Problems

inferred← citeshttps://doi.org/10.1007/bf03192558openalex-snapshot

Helly property, clique raphs, complementary graph classes, and sandwich problems

inferred← citeshttps://doi.org/10.1007/s00373-012-1203-xopenalex-snapshot

Helly Numbers of Polyominoes

inferred← citeshttps://doi.org/10.1007/s00453-014-9925-1openalex-snapshot

Obtaining Matrices with the Consecutive Ones Property by Row Deletions

inferred← citeshttps://doi.org/10.1007/s11042-018-6852-1openalex-snapshot

Helly hypergraph based matching framework using deterministic sampling techniques for spatially improved point feature based image matching

inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.047openalex-snapshot

On the strong p-Helly property

inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.013openalex-snapshot

Characterization and recognition of generalized clique-Helly graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.011openalex-snapshot

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs

inferred← citeshttps://doi.org/10.1016/j.dam.2019.06.025openalex-snapshot

Two infinite families of critical clique–Helly graphs

inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.002openalex-snapshot

A New Neighborhood for the QAP

inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.026openalex-snapshot

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs

inferred← citeshttps://doi.org/10.1016/j.endm.2017.10.040openalex-snapshot

On the Existence of Critical Clique-Helly Graphs

inferred← citeshttps://doi.org/10.1590/s0104-65002006000200002openalex-snapshot

Computational aspects of the Helly property: a survey

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.