On the public citation graph

The dimension of cycle-free orders

https://doi.org/10.1007/bf00814403
0 signed · 15 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-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_5openalex-snapshot
Dimension Theory for Ordered Sets
inferredcites →https://doi.org/10.1007/bf00385814openalex-snapshot
Cycle-free partial orders and chordal comparability graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70478-3openalex-snapshot
Problems and Conjectures in the Combinatorial Theory of Ordered Sets
inferredcites →https://doi.org/10.2307/2371374openalex-snapshot
Partially Ordered Sets

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11917496_16openalex-snapshot
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
inferred← citeshttps://doi.org/10.1007/bfb0019425openalex-snapshot
Dimension and algorithms
inferred← citeshttps://doi.org/10.1007/s11083-020-09536-1openalex-snapshot
On k-tree Containment Graphs of Paths in a Tree
inferred← citeshttps://doi.org/10.1016/j.dam.2010.01.005openalex-snapshot
An implicit representation of chordal comparability graphs in linear time
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00313-3openalex-snapshot
Split orders
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00137-1openalex-snapshot
Construction of a simple elimination scheme for a chordal comparability graph in linear time
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80150-7openalex-snapshot
Split Orders
inferred← citeshttps://doi.org/10.37236/1885openalex-snapshot
Words Avoiding a Reflexive Acyclic Relation
inferred← citeshttps://doi.org/10.5753/etc.2023.230521openalex-snapshot
As árvores características dos grafos cordais comparabilidade não possuem grau limitado
inferred← citeshttps://doi.org/10.5753/etc.2024.2950openalex-snapshot
Os grafos cordais comparabilidade como grafos de interseção
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.