On the public citation graph

Degree and local connectivity in digraphs

https://doi.org/10.1007/bf02579379
0 signed · 29 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.1002/mana.19720530113openalex-snapshot
Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
inferredcites →https://doi.org/10.1007/bf01432512openalex-snapshot
Grad und lokaler Zusammenhang in endlichen Graphen
inferredcites →https://doi.org/10.1007/bf02993903openalex-snapshot
Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
inferredcites →https://doi.org/10.1016/0095-8956(73)90018-xopenalex-snapshot
Connectivity in digraphs
inferredcites →https://doi.org/10.1016/s0195-6698(81)80042-xopenalex-snapshot
An Application of Connectivity Theory in Graphs to Factorizations of Elements in Groups
inferredcites →https://doi.org/10.1137/0114018openalex-snapshot
On Flows in Pseudosymmetric Networks

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.22844openalex-snapshot
Complete directed minors and chromatic number
inferred← citeshttps://doi.org/10.1002/rsa.21269openalex-snapshot
Immersions of Directed Graphs in Tournaments
inferred← citeshttps://doi.org/10.1007/bf01192525openalex-snapshot
Exixtence of vertices of local connectivityk in digraphs of large outdegree
inferred← citeshttps://doi.org/10.1007/s00493-021-4750-zopenalex-snapshot
Oriented Cycles in Digraphs of Large Outdegree
inferred← citeshttps://doi.org/10.1007/s11856-023-2572-yopenalex-snapshot
Immersion of complete digraphs in Eulerian digraphs
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.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.1016/j.ejc.2024.104022openalex-snapshot
Subdivisions in dicritical digraphs with large order or digirth
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.05.004openalex-snapshot
Immersion of transitive tournaments in digraphs with large minimum outdegree
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.02.009openalex-snapshot
Highly linked tournaments with large minimum out-degree
inferred← citeshttps://doi.org/10.1017/s0963548324000038openalex-snapshot
Antidirected subgraphs of oriented graphs
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22479.xopenalex-snapshot
Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number
inferred← citeshttps://doi.org/10.11606/t.45.2017.tde-23052017-100619openalex-snapshot
Graph colorings and digraph subdivisions
inferred← citeshttps://doi.org/10.37236/6521openalex-snapshot
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number
inferred← citeshttps://doi.org/10.48550/arxiv.1109.3741openalex-snapshot
Immersing complete digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1206.5467openalex-snapshot
Arc-Disjoint Cycles and Feedback Arc Sets
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.5753/ctd.2018.3655openalex-snapshot
Graph colorings and digraph subdivisions
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-113openalex-snapshot
Semidegree, edge density and antidirected subgraphs
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.