On the public citation graph
Complexity Aspects of the Helly Property: Graphs and Hypergraphs
0 signed · 110 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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.1007/11415770_24openalex-snapshot
Graph Theoretical Insights into Evolution of Multidomain Proteins
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-3-540-74839-7_24openalex-snapshot
Proper Helly Circular-Arc Graphs
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_8openalex-snapshot
Geometric Transversal Theory
inferredcites →https://doi.org/10.1007/bf01898794openalex-snapshot
Über eine Variante zum Hellyschen Satz
inferredcites →https://doi.org/10.1007/bf03353003openalex-snapshot
A Family of Clique Divergent Graphs with Linear Growth
inferredcites →https://doi.org/10.1007/s00453-009-9304-5openalex-snapshot
Linear-Time Recognition of Helly Circular-Arc Models and 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(92)90270-popenalex-snapshot
Convergence of iterated clique graphs
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)90004-4openalex-snapshot
Clique graphs and Helly graphs
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.dam.2007.05.047openalex-snapshot
On the strong p-Helly property
inferredcites →https://doi.org/10.1016/j.dam.2007.05.048openalex-snapshot
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
inferredcites →https://doi.org/10.1016/j.dam.2007.06.013openalex-snapshot
Characterization and recognition of generalized clique-Helly graphs
inferredcites →https://doi.org/10.1016/j.dam.2009.01.019openalex-snapshot
The clique operator on circular-arc graphs
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.disc.2009.09.022openalex-snapshot
Diamond-free circle graphs are Helly circle
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/j.ipl.2007.02.017openalex-snapshot
Faster recognition of clique-Helly and hereditary clique-Helly graphs
inferredcites →https://doi.org/10.1016/j.ipl.2008.05.013openalex-snapshot
Improved algorithms for recognizing p-Helly and hereditary p-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.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.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.1145/160985.161000openalex-snapshot
Helly theorems and generalized linear programming
inferredcites →https://doi.org/10.1145/174147.169675openalex-snapshot
Complexity and algorithms for reasoning about time
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.46298/dmtcs.440openalex-snapshot
On hereditary Helly classes of graphs
inferredcites →https://doi.org/10.5860/choice.37-1603openalex-snapshot
Invitation to discrete mathematics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22744openalex-snapshot
Domination in digraphs and their direct and Cartesian products
inferred← citeshttps://doi.org/10.1002/net.21998openalex-snapshot
A story of diameter, radius, and (almost) Helly property
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_22openalex-snapshot
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_30openalex-snapshot
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_3openalex-snapshot
Split Clique Graph Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_32openalex-snapshot
On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
inferred← citeshttps://doi.org/10.1007/s10801-026-01586-9openalex-snapshot
Helly number, domination and homology
inferred← citeshttps://doi.org/10.1016/j.cie.2017.10.015openalex-snapshot
Algorithms for the bin packing problem with overlapping items
inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.013openalex-snapshot
Characterization of classical graph classes by weighted clique graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.029openalex-snapshot
On neighborhood-Helly graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113230openalex-snapshot
On the clique behavior and Hellyness of the complements of regular graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.029openalex-snapshot
The colorful Helly theorem and general hypergraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.109openalex-snapshot
The Colorful Helly Property for Hypergraphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.026openalex-snapshot
On the Computational Complexity of the Helly Number in the P3 and Related Convexities
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103606openalex-snapshot
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.105650openalex-snapshot
Unsupervised bin-wise pre-training: A fusion of information theory and hypergraph
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.320openalex-snapshot
Some complexity results on cycle-convex partitions
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.020openalex-snapshot
Split clique graph complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.060openalex-snapshot
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.037openalex-snapshot
A unified approach to recognize squares of split graphs
inferred← citeshttps://doi.org/10.11575/cdm.v6i2.62059.g46707openalex-snapshot
A variant of the bipartite relation theorem and its application to clique graphs
inferred← citeshttps://doi.org/10.21711/231766362010/rmc392openalex-snapshot
On weighted clique graphs
inferred← citeshttps://doi.org/10.21711/231766362015/rmc4411openalex-snapshot
O Número de Helly Geodético em Convexidades
inferred← citeshttps://doi.org/10.23638/dmtcs-21-1-15openalex-snapshot
Clustered Spanning Tree - Conditions for Feasibility
inferred← citeshttps://doi.org/10.23638/dmtcs-22-1-19openalex-snapshot
The Complexity of Helly-$B_{1}$ EPG Graph Recognition
inferred← citeshttps://doi.org/10.46298/dmtcs.451openalex-snapshot
On economical set representations of graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.626openalex-snapshot
Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
inferred← citeshttps://doi.org/10.48550/arxiv.1303.1643openalex-snapshot
$d$-COS-R is FPT via Interval Deletion
inferred← citeshttps://doi.org/10.48550/arxiv.1410.2075openalex-snapshot
Squares of $3$-sun-free split graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1605.00558openalex-snapshot
Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items
inferred← citeshttps://doi.org/10.48550/arxiv.2007.15504openalex-snapshot
Domination in digraphs and their products
inferred← citeshttps://doi.org/10.5753/ctd.2021.15752openalex-snapshot
On the Helly Property of Some Intersection Graphs
inferred← citeshttps://doi.org/10.59254/sbpo-2018-85524openalex-snapshot
A Complexidade do Reconhecimento de Grafos B1-EPG-Helly
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.