On the public citation graph

Centers of triangulated graphs

https://doi.org/10.1007/bf01139575
0 signed · 27 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/jgt.3190040108openalex-snapshot
Centers of maximal outerplanar graphs
inferredcites →https://doi.org/10.1002/jgt.3190050413openalex-snapshot
On graphs containing a given graph as center
inferredcites →https://doi.org/10.1007/bf02992776openalex-snapshot
On rigid circuit graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90021-9openalex-snapshot
A Helly theorem for convexity in graphs
inferredcites →https://doi.org/10.1016/0166-218x(83)90068-9openalex-snapshot
On powers and centers of chordal graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70024-4openalex-snapshot
Centers of 2–Trees
inferredcites →https://doi.org/10.1515/crll.1869.70.185openalex-snapshot
Sur les assemblages de lignes.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36136-7_15openalex-snapshot
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_20openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/978-3-319-29221-2_21openalex-snapshot
On the Center Sets of Some Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-662-53536-3_13openalex-snapshot
Eccentricity Approximating Trees
inferred← citeshttps://doi.org/10.1007/s00373-022-02512-zopenalex-snapshot
Injective Hulls of Various Graph Classes
inferred← citeshttps://doi.org/10.1007/s00453-024-01223-6openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/s00453-025-01344-6openalex-snapshot
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.07.017openalex-snapshot
Eccentricity approximating trees
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112326openalex-snapshot
A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.08.022openalex-snapshot
Eccentric counts, connectivity and chordality
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105873openalex-snapshot
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.03.004openalex-snapshot
Eccentricity terrain of δ-hyperbolic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.004openalex-snapshot
Eccentricity function in distance-hereditary graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.022openalex-snapshot
Helly-gap of a graph and vertex eccentricities
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00337-8openalex-snapshot
Radius versus diameter in cocomparability and intersection graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00424-9openalex-snapshot
Tree spanners on chordal graphs: complexity and algorithms
inferred← citeshttps://doi.org/10.1137/s0895480195321718openalex-snapshot
Convexity and HHD-Free Graphs
inferred← citeshttps://doi.org/10.3390/math13050885openalex-snapshot
Center of Trapezoid Graph: Application in Selecting Center Location to Set up a Private Hospital
inferred← citeshttps://doi.org/10.48550/arxiv.1312.3182openalex-snapshot
On The Center Sets and Center Numbers of Some Graph Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1803.04660openalex-snapshot
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
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.