On the public citation graph
Hereditary modular graphs
0 signed · 42 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.3190020209openalex-snapshot
Perfect Elimination and Chordal Bipartite Graphs
inferredcites →https://doi.org/10.1016/0012-365x(85)90159-1openalex-snapshot
A characterization of absolute retracts of n-chromatic graphs
inferredcites →https://doi.org/10.1016/0095-8956(78)90013-8openalex-snapshot
On a class of posets and the corresponding comparability graphs
inferredcites →https://doi.org/10.1016/0095-8956(86)90043-2openalex-snapshot
Distance-hereditary graphs
inferredcites →https://doi.org/10.1016/0166-218x(87)90058-8openalex-snapshot
Absolute retracts of bipartite graphs
inferredcites →https://doi.org/10.1093/qmath/28.4.417openalex-snapshot
A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/aama.1999.0677openalex-snapshot
Graphs of Some CAT(0) Complexes
inferred← citeshttps://doi.org/10.1006/eujc.1997.0154openalex-snapshot
Minimum 0-Extensions of Graph Metrics
inferred← citeshttps://doi.org/10.1006/eujc.1999.0378openalex-snapshot
A Characterization of Minimizable Metrics in the Multifacility Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_37openalex-snapshot
Algorithms and Complexity Results for the Capacitated Vertex Cover Problem
inferred← citeshttps://doi.org/10.1007/bf01608533openalex-snapshot
Metrics with finite sets of primitive extensions
inferred← citeshttps://doi.org/10.1007/s00454-015-9743-5openalex-snapshot
Ramified Rectilinear Polygons: Coordinatization by Dendrons
inferred← citeshttps://doi.org/10.1007/s004930050040openalex-snapshot
A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations
inferred← citeshttps://doi.org/10.1007/s10107-014-0824-7openalex-snapshot
Discrete convexity and polynomial solvability in minimum 0-extension problems
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90093-7openalex-snapshot
On bridged graphs and cop-win graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90051-kopenalex-snapshot
Efficient characterizations of n-chromatic absolute retracts
inferred← citeshttps://doi.org/10.1016/0097-3165(87)90057-4openalex-snapshot
An infinitary version of the Graham-Leeb-Rothschild theorem
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90058-8openalex-snapshot
Absolute retracts of bipartite graphs
inferred← citeshttps://doi.org/10.1016/0377-2217(85)90004-9openalex-snapshot
Networks with condorcet solutions
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.03.001openalex-snapshot
Tight spans of distances and the dual fractionality of undirected multiflow problems
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00076-9openalex-snapshot
A note on r-dominating cliques
inferred← citeshttps://doi.org/10.1090/memo/1309openalex-snapshot
Weakly Modular Graphs and Nonpositive Curvature
inferred← citeshttps://doi.org/10.1112/tlm3.70016openalex-snapshot
7‐Location, weak systolicity, and isoperimetry
inferred← citeshttps://doi.org/10.1137/090767054openalex-snapshot
Folder Complexes and Multiflow Combinatorial Dualities
inferred← citeshttps://doi.org/10.1137/1.9781611973105.127openalex-snapshot
Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems: [Extended Abstract]
inferred← citeshttps://doi.org/10.1137/s0895480195291230openalex-snapshot
On Distance-Preserving and Domination Elimination Orderings
inferred← citeshttps://doi.org/10.1142/s021819671850056xopenalex-snapshot
Two-dimensional systolic complexes satisfy property A
inferred← citeshttps://doi.org/10.2140/agt.2025.25.3429openalex-snapshot
Asymptotic cones of snowflake groups and the strong shortcut property
inferred← citeshttps://doi.org/10.26493/2590-9770.1754.cd0openalex-snapshot
Primitive, edge-short, isometric, and pantochordal cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1409.3892openalex-snapshot
Weakly modular graphs and nonpositive curvature
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04630openalex-snapshot
Bisimplicial complexes and asphericity
inferred← citeshttps://doi.org/10.48550/arxiv.math/0004090openalex-snapshot
How to Uncross Some Modular Metrics
inferred← citeshttps://doi.org/10.70675/0daeac85z1b10z4ec2zaf23zecc28c279530openalex-snapshot
Densité, VC-dimension et étiquetages de graphes
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.