On the public citation graph
Universally signable graphs
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.
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.1016/0095-8956(75)90041-6openalex-snapshot
On certain polytopes associated with graphs
inferredcites →https://doi.org/10.1016/0095-8956(82)90028-4openalex-snapshot
Alpha-balanced graphs and matrices and GF(3)-representability of matroids
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.0.co;2-3openalex-snapshot
Even and odd holes in cap-free graphs
inferred← citeshttps://doi.org/10.1002/jgt.21651openalex-snapshot
A Class of Three‐Colorable Triangle‐Free Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21685openalex-snapshot
Hereditary Efficiently Dominatable Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22415openalex-snapshot
The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.22428openalex-snapshot
Clique cutsets beyond chordal graphs
inferred← citeshttps://doi.org/10.1002/jgt.23104openalex-snapshot
Tree independence number I. (Even hole, diamond, pyramid)‐free graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_687openalex-snapshot
LexBFS, Structure, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_32openalex-snapshot
(Even Hole, Triangle)-Free Graphs Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-96151-4_35openalex-snapshot
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_30openalex-snapshot
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_687-1openalex-snapshot
LexBFS, Structure, and Algorithms
inferred← citeshttps://doi.org/10.1007/s40863-022-00320-0openalex-snapshot
Theta-ring graphs, I$${{\mathcal {O}}}$$-compatibility and $$\Delta $$-matroids
inferred← citeshttps://doi.org/10.1016/j.dam.2010.11.010openalex-snapshot
On the forbidden induced subgraph sandwich problem
inferred← citeshttps://doi.org/10.1016/j.dam.2011.01.016openalex-snapshot
Graphs of separability at most 2
inferred← citeshttps://doi.org/10.1016/j.dam.2019.07.017openalex-snapshot
On the Lovász–Schrijver PSD-operator on graph classes defined by clique cutsets
inferred← citeshttps://doi.org/10.1016/j.disc.2014.12.014openalex-snapshot
Vertex elimination orderings for hereditary graph classes
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114743openalex-snapshot
Isometric path complexity of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.12.004openalex-snapshot
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.07.004openalex-snapshot
The (theta, wheel)-free graphs Part II: Structure theorem
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.03.005openalex-snapshot
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00290-0openalex-snapshot
Recognition of quasi-Meyniel graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139506748.008openalex-snapshot
The world of hereditary graph classes viewed through Truemper configurations
inferred← citeshttps://doi.org/10.1137/050628520openalex-snapshot
Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs
inferred← citeshttps://doi.org/10.1142/s0219498817501456openalex-snapshot
Implosive graphs: Square-free monomials on symbolic Rees algebras
inferred← citeshttps://doi.org/10.1216/jca.2021.13.461openalex-snapshot
Well-covered and Cohen–Macaulay theta-ring graphs
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2023.32openalex-snapshot
Isometric Path Complexity of Graphs
inferred← citeshttps://doi.org/10.70675/42e4b45bzcf92z4138zb61bze20049651147openalex-snapshot
Width Parameters on Even-Hole-Free 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.