On the public citation graph

On Representable Graphs

https://doi.org/10.25596/jalc-2008-045
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.
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.1142/s0218196705002293openalex-snapshot
THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM

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.4227619openalex-extracted
On Semi-Transitive Orientability of Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_14openalex-snapshot
Enumeration and Extensions of Word-Representants
inferred← citeshttps://doi.org/10.1007/978-3-319-25859-1_6openalex-snapshot
Representing Graphs via Pattern-Avoiding Words
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_2openalex-snapshot
A Comprehensive Introduction to the Theory of Word-Representable Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_41openalex-snapshot
Graphs Capturing Alternations in Words
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_46openalex-snapshot
On the Representability of Line Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_18openalex-snapshot
Alternation Graphs
inferred← citeshttps://doi.org/10.1007/s00236-024-00462-yopenalex-snapshot
Word-representable graphs from a word’s perspective
inferred← citeshttps://doi.org/10.1007/s00373-016-1693-zopenalex-snapshot
Word-Representability of Face Subdivisions of Triangular Grid Graphs
inferred← citeshttps://doi.org/10.1007/s10878-018-0358-7openalex-snapshot
On operations preserving semi-transitive orientability of graphs
inferred← citeshttps://doi.org/10.1007/s11083-008-9083-7openalex-snapshot
Word Problem of the Perkins Semigroup via Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.024openalex-snapshot
New results on word-representable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.033openalex-snapshot
Semi-transitive orientations and word-representable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.025openalex-snapshot
Word-representability of triangulations of grid-covered cylinder graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.013openalex-snapshot
On the representation number of a crown graph
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.063openalex-snapshot
Enumeration and extensions of word-representants
inferred← citeshttps://doi.org/10.1134/s1990478918020084openalex-snapshot
Word-Representable Graphs: a Survey
inferred← citeshttps://doi.org/10.1134/s1990478924040161openalex-snapshot
The $$ \ell $$-Rauzy Graphs on Infinite Words
inferred← citeshttps://doi.org/10.1515/puma-2015-0032openalex-snapshot
Colourability and word-representability of near-triangulations
inferred← citeshttps://doi.org/10.25596/jalc-2013-097openalex-snapshot
On Graphs With Representation Number 3
inferred← citeshttps://doi.org/10.3103/s1055134415010010openalex-snapshot
On word-representability of polyomino triangulations
inferred← citeshttps://doi.org/10.37236/4946openalex-snapshot
Representing Graphs via Pattern Avoiding Words
inferred← citeshttps://doi.org/10.48550/arxiv.0810.0310openalex-snapshot
On representable graphs, semi-transitive orientations, and the representation numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3527openalex-snapshot
On word-representability of polyomino triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.1503.05076openalex-snapshot
Word-representability of triangulations of rectangular polyomino with a single domino tile
inferred← citeshttps://doi.org/10.48550/arxiv.1507.03177openalex-snapshot
Existence of $u$-representation of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.05924openalex-snapshot
A Comprehensive Introduction to the Theory of Word-Representable Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1808.01800openalex-snapshot
The k-cube is k-representable
inferred← citeshttps://doi.org/10.48550/arxiv.2108.02363openalex-snapshot
On the Existence of Word-representable Line Graphs of Non-word-representable Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2109.03458openalex-snapshot
On the Representation Number of Bipartite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2110.05405openalex-snapshot
Human-verifiable proofs in the theory of word-representable graphs
inferred← citeshttps://doi.org/10.82444/warw.33754960openalex-snapshot
Graph parameters and the speed of hereditary properties
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.