On the public citation graph

On graphs that can be oriented as diagrams of ordered sets

https://doi.org/10.1007/bf00337921
0 signed · 45 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/bf01894680openalex-snapshot
On chromatic number of finite set-systems
inferredcites →https://doi.org/10.1007/bf02020444openalex-snapshot
On chromatic number of graphs and set-systems
inferredcites →https://doi.org/10.1007/bf02485441openalex-snapshot
Colouring lattices
inferredcites →https://doi.org/10.1016/0012-365x(77)90029-2openalex-snapshot
Path length in the covering graph of a lattice
inferredcites →https://doi.org/10.1016/0095-8956(79)90084-4openalex-snapshot
A short proof of the existence of highly chromatic hypergraphs without short cycles
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0507350-7openalex-snapshot
On a Probabilistic Graph-Theoretical Method
inferredcites →https://doi.org/10.1090/s0002-9939-1983-0695239-4openalex-snapshot
Graphs Orientable as Distributive Lattices
inferredcites →https://doi.org/10.21136/cmj.1975.101314openalex-snapshot
Unoriented graphs of modular lattices
inferredcites →https://doi.org/10.2307/2307489openalex-snapshot
4526
inferredcites →https://doi.org/10.4064/cm-3-2-161-162openalex-snapshot
Sur le coloriage des graphs
inferredcites →https://doi.org/10.4153/cjm-1965-088-1openalex-snapshot
Undirected Graphs Realizable as Graphs of Modular Lattices
inferredcites →https://doi.org/10.4153/cmb-1970-070-6openalex-snapshot
A Note on Undirected Graphs Realizable as P.O. Sets

What points at this work

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

inferred← citeshttps://doi.org/10.1006/eujc.2001.0517openalex-snapshot
An Ore-type Condition for Cyclability
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_24openalex-snapshot
Cops and Robber on Oriented Graphs with Respect to Push Operation
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-94-009-2639-4_1openalex-snapshot
Graphical Data Structures for Ordered Sets
inferred← citeshttps://doi.org/10.1007/bf00337892openalex-snapshot
Representing an ordered set as the intersection of super greedy linear extensions
inferred← citeshttps://doi.org/10.1007/bf00390104openalex-snapshot
On reorienting graphs by pushing down maximal vertices
inferred← citeshttps://doi.org/10.1007/bf01108825openalex-snapshot
On the complexity of diagram testing
inferred← citeshttps://doi.org/10.1007/bf02034330openalex-snapshot
Diagrams, orientations, and varieties
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(87)90015-xopenalex-snapshot
Characterization of diagrams by 0-1 inequalities
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90015-topenalex-snapshot
Balanced graphs and noncovering graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90045-4openalex-snapshot
Inversions, cuts, and orientations
inferred← citeshttps://doi.org/10.1016/j.dam.2003.05.002openalex-snapshot
Neighborhood unions and cyclability of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.013openalex-snapshot
Full orientability of graphs with at most one dependent arc
inferred← citeshttps://doi.org/10.1016/j.dam.2017.07.037openalex-snapshot
On oriented cliques with respect to push operation
inferred← citeshttps://doi.org/10.1016/j.dam.2025.12.067openalex-snapshot
Pushing Cops and Robber on graphs of maximum degree four
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.082openalex-snapshot
Non-cover generalized Mycielski, Kneser, and Schrijver graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.10.023openalex-snapshot
On homomorphisms of oriented graphs with respect to the push operation
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112151openalex-snapshot
Pushable chromatic number of graphs with degree constraints
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.112openalex-snapshot
Full Orientability of Graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00160-2openalex-snapshot
On reorienting graphs by pushing down maximal vertices—II
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00311-3openalex-snapshot
Characterization of simple edge-firing games
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70474-6openalex-snapshot
Removing Monotone Cycles from Orientations
inferred← citeshttps://doi.org/10.1016/s0252-9602(18)30481-8openalex-snapshot
POSETIZATIONS OF DIGRAPHS
inferred← citeshttps://doi.org/10.1134/s1990478918020084openalex-snapshot
Word-Representable Graphs: a Survey
inferred← citeshttps://doi.org/10.1137/0403047openalex-snapshot
Cycle Lengths and Graph Orientations
inferred← citeshttps://doi.org/10.37236/2027openalex-snapshot
The Number of Intervals in the $m$-Tamari Lattices
inferred← citeshttps://doi.org/10.37236/518openalex-snapshot
A Quasisymmetric Function Generalization of the Chromatic Symmetric Function
inferred← citeshttps://doi.org/10.48550/arxiv.1202.5720openalex-snapshot
When is the Direct Product of Generalized Mycielskians a Cover Graph?
inferred← citeshttps://doi.org/10.48550/arxiv.1202.6461openalex-snapshot
The Minimum Number of Dependent Arcs and a Related Parameter of Generalized Mycielski Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1508.07217openalex-snapshot
On homomorphism of oriented graphs with respect to push operation
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.70675/f2921823za23cz4033z826dz75bb8baf3242openalex-snapshot
A contribution to the theory of graph homomorphisms and colorings
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.