On the public citation graph
Kantendisjunkte Wege in Graphen
0 signed · 21 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.1007/bf01304873openalex-snapshot
Ecken vom Gradn in minimalenn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01304933openalex-snapshot
�ber minimaln-fach zusammenh�ngende, unendliche Graphen und ein Extremalproblem
inferredcites →https://doi.org/10.1007/bf01432512openalex-snapshot
Grad und lokaler Zusammenhang in endlichen Graphen
inferredcites →https://doi.org/10.1007/bf01433466openalex-snapshot
Minimalen-fach kantenzusammenh�ngende Graphen
inferredcites →https://doi.org/10.1007/bf02993546openalex-snapshot
kreuzungsfreiea,b-Wege in endlichen Graphen
inferredcites →https://doi.org/10.1515/crll.1972.252.178openalex-snapshot
Minimally n-line connected 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.23286openalex-snapshot
Maximal Spectral Radius of Minimally k‐(Edge)‐Connected Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1993.1039openalex-snapshot
The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph
inferred← citeshttps://doi.org/10.1007/s00493-019-3882-xopenalex-snapshot
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90198-xopenalex-snapshot
On k-minimally n-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90445-lopenalex-snapshot
A remark on the number of vertices of degree k in a minimally k-edge-connected graph
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90043-5openalex-snapshot
Indestructive deletions of edges from graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90045-7openalex-snapshot
Local edge-connectivity in regular bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.11.009openalex-snapshot
On vertices of outdegree k in minimally k -arc-connected digraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.11.003openalex-snapshot
Generalized cut trees for edge-connectivity
inferred← citeshttps://doi.org/10.1017/s0963548300001498openalex-snapshot
On Vertices of Degree n in Minimally n -Edge-Connected Graphs
inferred← citeshttps://doi.org/10.1137/100783686openalex-snapshot
Ends and Vertices of Small Degree in Infinite Minimally k -(Edge)-Connected Graphs
inferred← citeshttps://doi.org/10.2139/ssrn.4903711openalex-snapshot
On Vertices of Outdegree K In Minimally K-Arc-Connected Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1707.00572openalex-snapshot
Cut Tree Structures with Applications on Contraction-Based Sparsification
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09579openalex-snapshot
Exponentially many nowhere-zero $Z_3$-, $Z_4$-, and $Z_6$-flows
inferred← citeshttps://doi.org/10.48550/arxiv.math/0605646openalex-snapshot
A Summary of Problems and Results related to the Caccetta-Haggkvist Conjecture
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.