On the public citation graph
Exixtence of vertices of local connectivityk in digraphs of large outdegree
0 signed · 22 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.3190170302openalex-snapshot
On sparse subgraphs preserving connectivity properties
inferredcites →https://doi.org/10.1002/zamm.19740541035openalex-snapshot
H. Sachs, Einführung in die Theorie der endlichen Graphen. 182 Seiten. Carl Hanser Verlag München 1971
inferredcites →https://doi.org/10.1007/bf01350130openalex-snapshot
Existenz gewisser Konfigurationen inn-ges�ttigten Graphen und in Graphen gen�gend gro�er Kantendichte
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1007/bf01432512openalex-snapshot
Grad und lokaler Zusammenhang in endlichen Graphen
inferredcites →https://doi.org/10.1007/bf01432539openalex-snapshot
Ecken mit starken Zusammenhangseigenschaften in endlichen Graphen
inferredcites →https://doi.org/10.1007/bf02579379openalex-snapshot
Degree and local connectivity in digraphs
inferredcites →https://doi.org/10.1016/0095-8956(81)90085-xopenalex-snapshot
Quelques problèmes de connexité dans les graphes orientés
inferredcites →https://doi.org/10.1016/0095-8956(91)90077-wopenalex-snapshot
Ecken von kleinem grad in kritisch n-fach zusammenhängenden digraphen
inferredcites →https://doi.org/10.1016/s0195-6698(85)80025-1openalex-snapshot
Even Cycles in Directed Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20255openalex-snapshot
A note on complete subdivisions in digraphs of large outdegree
inferred← citeshttps://doi.org/10.1002/jgt.20411openalex-snapshot
Existence of openly disjoint circuits through a vertex
inferred← citeshttps://doi.org/10.1002/jgt.22844openalex-snapshot
Complete directed minors and chromatic number
inferred← citeshttps://doi.org/10.1007/s00493-021-4750-zopenalex-snapshot
Oriented Cycles in Digraphs of Large Outdegree
inferred← citeshttps://doi.org/10.1016/j.dam.2026.09.003openalex-snapshot
Tightening the girth bound for C(k,k) subdivisions in digraphs with minimum out-degree two
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.035openalex-snapshot
Openly disjoint circuits through a vertex in regular digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115441openalex-snapshot
Subdivisions of theta digraphs under minimum out-degree condition
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.02.002openalex-snapshot
Immersing complete digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2101.04590openalex-snapshot
Complete minors in digraphs with given dichromatic number
inferred← citeshttps://doi.org/10.48550/arxiv.math/0605646openalex-snapshot
A Summary of Problems and Results related to the Caccetta-Haggkvist Conjecture
inferred← citeshttps://doi.org/10.70675/28405a1bzc7e3z4648zabefzba13f7307f0fopenalex-snapshot
Substructures in 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.