On the public citation graph
Directed hypergraphs: A tool for researching digraphs and hypergraphs
0 signed · 26 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.20491openalex-snapshot
On the pseudoachromatic index of the complete graph
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1007/s00209-007-0238-9openalex-snapshot
Multiple solutions to the pure critical exponent problem in domains with a hole of arbitrary size
inferredcites →https://doi.org/10.1016/0012-365x(81)90264-8openalex-snapshot
A note on kernel-critical graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90131-6openalex-snapshot
On kernels and semikernels of digraphs
inferredcites →https://doi.org/10.1016/0012-365x(86)90172-xopenalex-snapshot
On kernel-perfect critical digraphs
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7007-2openalex-snapshot
Hypergraphs - Combinatorics of Finite Sets
inferredcites →https://doi.org/10.1073/pnas.39.7.649openalex-snapshot
Extension Theorems for Solutions of Irreflexive Relations
inferredcites →https://doi.org/10.1145/1400751.1400791openalex-snapshot
New combinatorial topology upper and lower bounds for renaming
inferredcites →https://doi.org/10.1214/ejp.v14-637openalex-snapshot
On the asymptotic behaviour of increasing self-similar Markov processes
inferredcites →https://doi.org/10.7151/dmgt.1451openalex-snapshot
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments
inferredcites →https://doi.org/10.7151/dmgt.1512openalex-snapshot
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-06222-4_7openalex-snapshot
Business Network Analytics: From Graphs to Supernetworks
inferred← citeshttps://doi.org/10.1007/s00373-013-1384-yopenalex-snapshot
Vertex and Edge Dimension of Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00454-010-9299-3openalex-snapshot
Hyperseparoids: A Representation Theorem
inferred← citeshttps://doi.org/10.1007/s00454-011-9379-zopenalex-snapshot
A Generalisation of Tverberg’s Theorem
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.008openalex-snapshot
A note on the upper bound and girth pair of (k;g) -cages
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.005openalex-snapshot
k -kernels in k -transitive and k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1103/physreve.106.064310openalex-snapshot
Class of models for random hypergraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1530openalex-snapshot
Cyclically k-partite digraphs and k-kernels
inferred← citeshttps://doi.org/10.7151/dmgt.1544openalex-snapshot
Kernels by monochromatic paths and the color-class digraph
inferred← citeshttps://doi.org/10.7151/dmgt.1546openalex-snapshot
k-kernels in generalizations of transitive digraphs
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.