On the public citation graph

Domination in quadrangle-free helly graphs

https://doi.org/10.1007/bf01122734
0 signed · 33 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.1016/0012-365x(83)90154-1openalex-snapshot
Characterizations of strongly chordal graphs
inferredcites →https://doi.org/10.1016/0012-365x(86)90212-8openalex-snapshot
Pseudo-modular graphs
inferredcites →https://doi.org/10.1016/0012-365x(87)90100-2openalex-snapshot
Bridged graphs and geodesic convexity
inferredcites →https://doi.org/10.1016/0012-365x(90)90357-nopenalex-snapshot
Dominating sets in perfect graphs
inferredcites →https://doi.org/10.1016/0020-0190(75)90011-3openalex-snapshot
A linear algorithm for the domination number of a tree
inferredcites →https://doi.org/10.1016/0095-8956(85)90050-4openalex-snapshot
Weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0166-218x(83)90003-3openalex-snapshot
A linear algorithm for the domination number of a series-parallel graph
inferredcites →https://doi.org/10.1016/0166-218x(84)90061-1openalex-snapshot
Domination, independent domination, and duality in strongly chordal graphs
inferredcites →https://doi.org/10.1016/0166-218x(84)90088-xopenalex-snapshot
Clustering and domination in perfect graphs
inferredcites →https://doi.org/10.1016/0166-218x(85)90025-3openalex-snapshot
Dominating sets and domatic number of circular arc graphs
inferredcites →https://doi.org/10.1016/0166-218x(86)90089-2openalex-snapshot
A linear algorithm for finding a minimum dominating set in a cactus
inferredcites →https://doi.org/10.1016/0166-218x(88)90120-5openalex-snapshot
Labeling algorithms for domination problems in sun-free chordal graphs
inferredcites →https://doi.org/10.1016/0196-6774(85)90001-xopenalex-snapshot
Domination in permutation graphs
inferredcites →https://doi.org/10.1016/0304-3975(87)90067-3openalex-snapshot
The NP-completeness of steiner tree and dominating set for chordal bipartite graphs
inferredcites →https://doi.org/10.1016/s0012-365x(97)00268-9openalex-snapshot
A characterization of strongly chordal graphs
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)72943-8openalex-snapshot
Polynomial Algorithms for Perfect Graphs
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0211015openalex-snapshot
Dominating Sets in Chordal Graphs
inferredcites →https://doi.org/10.1137/0605034openalex-snapshot
The k -Domination and k -Stability Problems on Sun-Free Chordal Graphs
inferredcites →https://doi.org/10.1137/0606012openalex-snapshot
Covering, Packing and Generalized Perfection
inferredcites →https://doi.org/10.1145/321958.321964openalex-snapshot
R -Domination in Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.21998openalex-snapshot
A story of diameter, radius, and (almost) Helly property
inferred← citeshttps://doi.org/10.1006/gmip.1997.0437openalex-snapshot
Combinatorics and Image Processing
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-030-86838-3_25openalex-snapshot
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.017openalex-snapshot
Obstructions to a small hyperbolicity in Helly graphs
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.tcs.2023.113690openalex-snapshot
Distance problems within Helly graphs and k-Helly graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00186-7openalex-snapshot
A polynomial algorithm for the strong Helly property
inferred← citeshttps://doi.org/10.1016/s1076-5670(04)31001-3openalex-snapshot
Introduction to Hypergraph Theory and Its Use in Engineering and Image Processing
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80985-xopenalex-snapshot
An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
inferred← citeshttps://doi.org/10.48550/arxiv.1910.10412openalex-snapshot
A story of diameter, radius and Helly property
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.