On the public citation graph

On reorienting graphs by pushing down maximal vertices

https://doi.org/10.1007/bf00390104
0 signed · 51 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-5315-4_3openalex-snapshot
The Diagram
inferredcites →https://doi.org/10.1007/bf00337921openalex-snapshot
On graphs that can be oriented as diagrams of ordered sets
inferredcites →https://doi.org/10.1007/bf00337928openalex-snapshot
Unsolved problems
inferredcites →https://doi.org/10.1016/0012-365x(87)90015-xopenalex-snapshot
Characterization of diagrams by 0-1 inequalities
inferredcites →https://doi.org/10.1080/00029890.1962.11989938openalex-snapshot
A Theorem on n-Coloring the Points of a Linear Graph
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory

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-18812-6_6openalex-snapshot
Cycle Equivalence of Finite Dynamical Systems Containing Symmetries
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/bf01108623openalex-snapshot
Orientations of chain groups
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)90015-xopenalex-snapshot
Characterization of diagrams by 0-1 inequalities
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/j.aim.2020.107027openalex-snapshot
The B-model connection and mirror symmetry for Grassmannians
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.2023.01.013openalex-snapshot
On the pushable chromatic number of various types of grids
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/j.tcs.2004.03.019openalex-snapshot
Sandpile models and lattices: a comprehensive survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.015openalex-snapshot
An atlas of limit set dynamics for asynchronous elementary cellular automata
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(01)00319-2openalex-snapshot
Coding distributive lattices with Edge Firing Games
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00311-3openalex-snapshot
Characterization of simple edge-firing games
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00122-xopenalex-snapshot
Source reversal and chip firing on graphs
inferred← citeshttps://doi.org/10.1090/proc/16079openalex-snapshot
Toric promotion
inferred← citeshttps://doi.org/10.1090/tran/6356openalex-snapshot
Toric partial orders
inferred← citeshttps://doi.org/10.1137/0403047openalex-snapshot
Cycle Lengths and Graph Orientations
inferred← citeshttps://doi.org/10.1142/s1793525320500119openalex-snapshot
Minimal Penner dilatations on nonorientable surfaces
inferred← citeshttps://doi.org/10.2140/agt.2022.22.2355openalex-snapshot
First-return maps of Birkhoff sections of the geodesic flow
inferred← citeshttps://doi.org/10.37236/1768openalex-snapshot
Lattice Structures from Planar Graphs
inferred← citeshttps://doi.org/10.37236/684openalex-snapshot
Posets from Admissible Coxeter Sequences
inferred← citeshttps://doi.org/10.37236/70openalex-snapshot
Conjugacy of Coxeter Elements
inferred← citeshttps://doi.org/10.37236/9474openalex-snapshot
Lattice Structure for Orientations of Graphs
inferred← citeshttps://doi.org/10.4236/ojdm.2019.94010openalex-snapshot
Toric Heaps, Cyclic Reducibility, and Conjugacy in Coxeter Groups
inferred← citeshttps://doi.org/10.48550/arxiv.0910.4376openalex-snapshot
Posets from Admissible Coxeter Sequences
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.1211.4247openalex-snapshot
Toric partial orders
inferred← citeshttps://doi.org/10.48550/arxiv.1302.2842openalex-snapshot
Conjugacy of Coxeter elements
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.2008.09862openalex-snapshot
Notes on the combinatorial fundamentals of algebra
inferred← citeshttps://doi.org/10.5070/c61055363openalex-snapshot
Friends and strangers walking on graphs
inferred← citeshttps://doi.org/10.70675/b1ee0623z0e05z4c73zbf01z015fe2aeb779openalex-snapshot
Anosov flows and Birkhoff sections
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.