On the public citation graph

On Semi-Transitive Orientability of Split Graphs

https://doi.org/10.2139/ssrn.4227619
0 signed · 14 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.1007/978-3-319-25859-1openalex-extracted
Words and Graphs
inferredcites →https://doi.org/10.1016/j.dam.2015.07.033openalex-extracted
Semi-transitive orientations and word-representable graphs
inferredcites →https://doi.org/10.1016/j.dam.2022.02.023openalex-extracted
Word-representability of split graphs generated by morphisms
inferredcites →https://doi.org/10.1016/j.tcs.2020.08.028openalex-extracted
Vertex deletion on split graphs: Beyond 4-hitting set
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-extracted
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0304-3975(02)00435-8openalex-extracted
PC trees and circular-ones arrangements
inferredcites →https://doi.org/10.1134/s1990478918020084openalex-extracted
Word-Representable Graphs: a Survey
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-extracted
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.25596/jalc-2008-045openalex-extracted
On Representable Graphs
inferredcites →https://doi.org/10.4310/joc.2021.v12.n4.a6openalex-extracted
Word-representability of split graphs
inferredcites →https://doi.org/10.4310/joc.2023.v14.n1.a5openalex-extracted
Semi-transitivity of directed split graphs generated by morphisms
inferredcites →https://doi.org/10.46298/dmtcs.625openalex-extracted
Isomorphism of graph classes related to the circular-ones property

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.5375907openalex-extracted
Word-Representability of Co-Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_18openalex-snapshot
Word-Representable Graphs from a Word’s Perspective
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.