On the public citation graph

Complexity of diagrams

https://doi.org/10.1007/bf00340774
0 signed · 37 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-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/bf00333136openalex-snapshot
A remark on covering graphs
inferredcites →https://doi.org/10.1007/bf00396277openalex-snapshot
Unsolved problems
inferredcites →https://doi.org/10.1007/bf01191498openalex-snapshot
Combinatorial partitions of finite posets and lattices —Ramsey lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0507350-7openalex-snapshot
On a Probabilistic Graph-Theoretical Method
inferredcites →https://doi.org/10.4153/cjm-1959-003-9openalex-snapshot
Graph Theory and Probability

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032497.ch10openalex-snapshot
Algorithms
inferred← citeshttps://doi.org/10.1002/jgt.20007openalex-snapshot
Dependent edges in Mycielski graphs and 4‐colorings of 4‐skeletons
inferred← citeshttps://doi.org/10.1006/jctb.1997.1769openalex-snapshot
The Number of Dependent Arcs in an Acyclic Orientation
inferred← citeshttps://doi.org/10.1007/978-3-030-95018-7_5openalex-snapshot
Comparability Graphs Among Cover-Incomparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_15openalex-snapshot
A Combinatorial Classic — Sparse Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_1openalex-snapshot
Graphical Data Structures for Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_23openalex-snapshot
Problems About Planar Orders
inferred← citeshttps://doi.org/10.1007/bf00353654openalex-snapshot
Planar acyclic oriented graphs
inferred← citeshttps://doi.org/10.1007/bf01108704openalex-snapshot
Every triangle-free planar graph has a planar upward drawing
inferred← citeshttps://doi.org/10.1007/bf01108825openalex-snapshot
On the complexity of diagram testing
inferred← citeshttps://doi.org/10.1007/bf01110379openalex-snapshot
The complexity of cover graph recognition for some varieties of finite lattices
inferred← citeshttps://doi.org/10.1007/bf01190783openalex-snapshot
Lattices contained in planar orders are planar
inferred← citeshttps://doi.org/10.1007/bf02034330openalex-snapshot
Diagrams, orientations, and varieties
inferred← citeshttps://doi.org/10.1007/s00493-014-3081-8openalex-snapshot
Tree-width and dimension
inferred← citeshttps://doi.org/10.1007/s11083-008-9097-1openalex-snapshot
Cover-Incomparability Graphs of Posets
inferred← citeshttps://doi.org/10.1007/s11083-009-9117-9openalex-snapshot
On the Complexity of Cover-Incomparability Graphs of Posets
inferred← citeshttps://doi.org/10.1007/s11083-015-9369-5openalex-snapshot
Planar Posets, Dimension, Breadth and the Number of Minimal Elements
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90012-4openalex-snapshot
A non-covering graph of girth six
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90099-4openalex-snapshot
Covering posets
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90004-lopenalex-snapshot
Reorientations of covering graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90012-qopenalex-snapshot
Enumerating orientations of ordered sets
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90045-4openalex-snapshot
Inversions, cuts, and orientations
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0182-4openalex-snapshot
On edge transitivity of directed graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90022-oopenalex-snapshot
Efficient polynomial algorithms for distributive lattices
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90096-5openalex-snapshot
Constructing colorings for diagrams
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.017openalex-snapshot
Dimension and height for posets with planar cover graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70474-6openalex-snapshot
Removing Monotone Cycles from Orientations
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80008-xopenalex-snapshot
Orders with Level Diagrams
inferred← citeshttps://doi.org/10.1109/twc.2019.2942032openalex-snapshot
User-Cache Aided Transmission With Index Coding in $K$ -User Downlink Channels
inferred← citeshttps://doi.org/10.1137/0403047openalex-snapshot
Cycle Lengths and Graph Orientations
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.