On the public citation graph

Existenz gewisser Konfigurationen inn-ges�ttigten Graphen und in Graphen gen�gend gro�er Kantendichte

https://doi.org/10.1007/bf01350130
0 signed · 30 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/bf01433466openalex-snapshot
Minimalen-fach kantenzusammenh�ngende Graphen
inferredcites →https://doi.org/10.1007/bf02992931openalex-snapshot
Zur Theorie dern-fach zusammenhängenden Graphen
inferredcites →https://doi.org/10.1016/s0021-9800(69)80049-9openalex-snapshot
A theorem on n-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.20477openalex-snapshot
Cycles of even lengths modulo k
inferred← citeshttps://doi.org/10.1002/jgt.22818openalex-snapshot
Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$
inferred← citeshttps://doi.org/10.1002/jgt.3190080103openalex-snapshot
Subdivisions of graphs with large minimum degree
inferred← citeshttps://doi.org/10.1002/jgt.3190090302openalex-snapshot
Gabriel andrew dirac
inferred← citeshttps://doi.org/10.1002/mana.19720530113openalex-snapshot
Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_4openalex-snapshot
Extremal problems for cycles in graphs
inferred← citeshttps://doi.org/10.1007/bf01187240openalex-snapshot
Ein Extremalproblem des Zusammenhangs von Graphen
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/bf01304933openalex-snapshot
�ber minimaln-fach zusammenh�ngende, unendliche Graphen und ein Extremalproblem
inferred← citeshttps://doi.org/10.1007/bf01432512openalex-snapshot
Grad und lokaler Zusammenhang in endlichen Graphen
inferred← citeshttps://doi.org/10.1007/bf01432539openalex-snapshot
Ecken mit starken Zusammenhangseigenschaften in endlichen Graphen
inferred← citeshttps://doi.org/10.1007/bf02582930openalex-snapshot
Hyperconnectivity of graphs
inferred← citeshttps://doi.org/10.1007/bf02582956openalex-snapshot
Subgraphs with large degrees and girth
inferred← citeshttps://doi.org/10.1007/bf02993546openalex-snapshot
kreuzungsfreiea,b-Wege in endlichen Graphen
inferred← citeshttps://doi.org/10.1007/s00453-019-00608-2openalex-snapshot
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs
inferred← citeshttps://doi.org/10.1007/s10587-009-0056-9openalex-snapshot
The eavesdropping number of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90161-aopenalex-snapshot
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90082-3openalex-snapshot
On k-rails in graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90067-9openalex-snapshot
Girth in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.11.011openalex-snapshot
Sparse graph certificates for mixed connectivity
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.037openalex-snapshot
Non-separating trees in connected graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104042openalex-snapshot
Biclique immersions in graphs with independence number 2
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.11.003openalex-snapshot
Generalized cut trees for edge-connectivity
inferred← citeshttps://doi.org/10.1017/s0963548301004904openalex-snapshot
A Note on Vertex-Disjoint Cycles
inferred← citeshttps://doi.org/10.26855/jamc.2025.03.007openalex-snapshot
The Cohesive Degree Condition of Non-separating Subtree Problems in Graph Partition
inferred← citeshttps://doi.org/10.48550/arxiv.1707.00572openalex-snapshot
Cut Tree Structures with Applications on Contraction-Based Sparsification
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.