On the public citation graph

Centers of chordal graphs

https://doi.org/10.1007/bf01787637
0 signed · 21 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.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70024-4openalex-snapshot
Centers of 2–Trees
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.1515/crll.1869.70.185openalex-snapshot
Sur les assemblages de lignes.
inferredcites →https://doi.org/10.2307/1969824openalex-snapshot
The Dissimilarity Characteristic of Husimi Trees

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-58218-5_34openalex-snapshot
Dominating cliques in distance-hereditary graphs
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/bf02986676openalex-snapshot
About a conjecture on the centers of chordal graphs
inferred← citeshttps://doi.org/10.1007/bfb0049406openalex-snapshot
A linear-time algorithm for finding a central vertex of a chordal graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.02.001openalex-snapshot
Proximity and average eccentricity of a graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.08.022openalex-snapshot
Eccentric counts, connectivity and chordality
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00630-1openalex-snapshot
Centers and medians of distance-hereditary graphs
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.1142/s1793005725500188openalex-snapshot
On the Center of Fuzzy Strong Chordal Graphs
inferred← citeshttps://doi.org/10.26637/mjm0s01/0091openalex-snapshot
A study on fuzzy Chordal graphs
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.5269/bspm.63331openalex-snapshot
A note on 4-self-centered 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.