On the public citation graph

Word-Representability of Co-Bipartite Graphs

https://doi.org/10.2139/ssrn.5375907
0 signed · 28 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/3-540-36136-7_5openalex-extracted
On the Clique-Width of Graphs in Hereditary Classes
inferredcites →https://doi.org/10.1007/3-540-57785-8_189openalex-extracted
On the complexity of the maximum cut problem
inferredcites →https://doi.org/10.1007/978-1-4614-7254-4_6openalex-extracted
Hereditary and Monotone Properties of Graphs
inferredcites →https://doi.org/10.1007/978-3-319-25859-1openalex-extracted
Words and Graphs
inferredcites →https://doi.org/10.1007/978-3-319-62809-7_2openalex-extracted
A Comprehensive Introduction to the Theory of Word-Representable Graphs
inferredcites →https://doi.org/10.1007/978-3-642-22321-1_46openalex-extracted
On the Representability of Line Graphs
inferredcites →https://doi.org/10.1007/978-3-642-25870-1_18openalex-extracted
Alternation Graphs
inferredcites →https://doi.org/10.1007/978-3-642-60406-5_7openalex-extracted
Hereditary and Monotone Properties of Graphs
inferredcites →https://doi.org/10.1007/s11083-008-9083-7openalex-extracted
Word Problem of the Perkins Semigroup via Directed Acyclic Graphs
inferredcites →https://doi.org/10.1016/j.dam.2014.10.024openalex-extracted
New results on word-representable 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.2018.03.004openalex-extracted
On the complexity of cd-coloring of graphs
inferredcites →https://doi.org/10.1016/j.ipl.2023.106435openalex-extracted
On semi-transitive orientability of split graphs
inferredcites →https://doi.org/10.1016/j.jctb.2010.10.001openalex-extracted
The structure of almost all graphs in a hereditary property
inferredcites →https://doi.org/10.1016/s0166-218x(98)00116-4openalex-extracted
The complexity of some problems related to Graph 3-colorability
inferredcites →https://doi.org/10.1051/ita/2024004openalex-extracted
Human-verifiable proofs in the theory of word-representable graphs
inferredcites →https://doi.org/10.1112/blms/27.5.417openalex-extracted
Projections of Bodies and Hereditary Properties of Hypergraphs
inferredcites →https://doi.org/10.2139/ssrn.4227619openalex-extracted
On Semi-Transitive Orientability of Split Graphs
inferredcites →https://doi.org/10.2139/ssrn.5336494openalex-extracted
On 2-Word Representable Graphs
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-extracted
A Characterization of Comparability Graphs and of Interval 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.48550/arxiv.2110.05405openalex-extracted
Human-verifiable proofs in the theory of word-representable graphs
inferredcites →https://doi.org/10.7151/dmgt.2344openalex-extracted
Representing split graphs by words
inferredcites →https://doi.org/10.1016/j.dam.2018.03.013openalex-snapshot
On the representation number of a crown graph
inferredcites →https://doi.org/10.1016/j.dam.2022.02.023openalex-snapshot
Word-representability of split graphs generated by morphisms

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-032-17156-6_24openalex-snapshot
Boxicity of a Class of Split Graphs Using Words
inferred← citeshttps://doi.org/10.1007/978-3-032-32016-2_1openalex-snapshot
2-Word-$$\pi $$-Representable 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.