On the public citation graph
Graphs of low chordality
0 signed · 34 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.1006/eujc.1999.0381openalex-snapshot
A Note on Distance Approximating Trees in Graphs
inferredcites →https://doi.org/10.1007/bf01456961openalex-snapshot
Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre
inferredcites →https://doi.org/10.1007/bf02579141openalex-snapshot
Lower bound of the hadwiger number of graphs by their average degree
inferredcites →https://doi.org/10.1016/0012-365x(85)90043-3openalex-snapshot
Edge and vertex intersection of paths in a tree
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal graphs
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(86)90043-2openalex-snapshot
Distance-hereditary graphs
inferredcites →https://doi.org/10.1016/j.jalgor.2004.09.002openalex-snapshot
Estimating all pairs shortest paths in restricted graph families: a unified approach
inferredcites →https://doi.org/10.1016/s0020-0190(01)00222-8openalex-snapshot
Algorithms for maximum weight induced paths
inferredcites →https://doi.org/10.1016/s0020-0190(03)00286-2openalex-snapshot
A spectral lower bound for the treewidth of a graph and its consequences
inferredcites →https://doi.org/10.1016/s0166-218x(97)00031-0openalex-snapshot
Treewidth for graphs with small chordality
inferredcites →https://doi.org/10.1016/s0304-0208(08)72924-4openalex-snapshot
Classical Perfect Graphs
inferredcites →https://doi.org/10.1016/s1571-0653(05)00731-6openalex-snapshot
A note on distance approximating trees in graphs
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1137/0210022openalex-snapshot
Node-Deletion Problems on Bipartite Graphs
inferredcites →https://doi.org/10.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_10openalex-snapshot
Metric Dimension of Bounded Width Graphs
inferred← citeshttps://doi.org/10.1007/s00026-011-0117-2openalex-snapshot
Minimal Classes of Graphs of Unbounded Clique-Width
inferred← citeshttps://doi.org/10.1016/j.dam.2008.01.019openalex-snapshot
An improved algorithm for the longest induced path problem on k -chordal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.009openalex-snapshot
Induced 2-regular subgraphs in k -chordal cubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.032openalex-snapshot
Partitioning the vertices of a cubic graph into two total dominating sets
inferred← citeshttps://doi.org/10.1016/j.disc.2013.08.032openalex-snapshot
A Dirac-type characterization of k -chordal graphs
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2013.09.039openalex-snapshot
Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases
inferred← citeshttps://doi.org/10.1137/16m1057383openalex-snapshot
Metric Dimension of Bounded Tree-length Graphs
inferred← citeshttps://doi.org/10.1142/s1793830922500197openalex-snapshot
Inductive graph invariants and approximation algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1108.0277openalex-snapshot
Bipartite powers of k-chordal graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1206.5397openalex-snapshot
A Dirac-type Characterization of k-chordal Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1406.2438openalex-snapshot
Induced 2-Regular Subgraphs in k-Chordal Cubic 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.