On the public citation graph

Untersuchungen �ber minimalen-fach zusammenh�ngende Graphen

https://doi.org/10.1007/bf01350321
0 signed · 51 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.1007/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01362665openalex-snapshot
�ber trennende Eckenmengen in Graphen und den Mengerschen Satz
inferredcites →https://doi.org/10.1007/bf02992931openalex-snapshot
Zur Theorie dern-fach zusammenhängenden Graphen
inferredcites →https://doi.org/10.1016/s1385-7258(61)50045-5openalex-snapshot
A theory of 3-connected graphs
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs
inferredcites →https://doi.org/10.1515/crll.1967.228.204openalex-snapshot
Minimally 2-connected graphs.
inferredcites →https://doi.org/10.3138/9781487584863openalex-snapshot
Connectivity in Graphs

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-642-11110-5_4openalex-snapshot
On 3-Connected Matroids and Graphs
inferred← citeshttps://doi.org/10.1007/bf01202787openalex-snapshot
Decomposition of 3-connected graphs
inferred← citeshttps://doi.org/10.1007/bf01304873openalex-snapshot
Ecken vom Gradn in minimalenn-fach zusammenh�ngenden Graphen
inferred← citeshttps://doi.org/10.1007/bf01304933openalex-snapshot
�ber minimaln-fach zusammenh�ngende, unendliche Graphen und ein Extremalproblem
inferred← citeshttps://doi.org/10.1007/bf01350799openalex-snapshot
Kreise beschr�nkter L�nge in gewissen minimalenn-fach zusammenh�ngenden Graphen
inferred← citeshttps://doi.org/10.1007/bf01428195openalex-snapshot
1-Faktoren von Graphen
inferred← citeshttps://doi.org/10.1007/bf02950646openalex-snapshot
Zur Struktur minimaln-fach zusammenhängender Graphen
inferred← citeshttps://doi.org/10.1007/bf02992473openalex-snapshot
Eckenn-ten Grades in minimalenn-fach zusammenhängenden Graphen
inferred← citeshttps://doi.org/10.1007/bf02995910openalex-snapshot
Unendliche minimalen-fach zusammenhängende Graphen
inferred← citeshttps://doi.org/10.1007/s00373-004-0591-yopenalex-snapshot
Vertices of Degree 5 in a Contraction Critically 5-connected Graph
inferred← citeshttps://doi.org/10.1007/s00373-006-0661-4openalex-snapshot
An Extremal Problem on Contractible Edges in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-007-0698-zopenalex-snapshot
Reduction for 3-Connected Graphs of Minimum Degree at Least Four
inferred← citeshttps://doi.org/10.1007/s00493-021-4592-8openalex-snapshot
Excluding a Ladder
inferred← citeshttps://doi.org/10.1007/s12188-016-0173-yopenalex-snapshot
Critical vertices in k-connected digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90206-0openalex-snapshot
On some extremal connectivity results for graphs and matroids
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90216-6openalex-snapshot
Generalizations of critical connectivity of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90293-qopenalex-snapshot
On two dual classes of planar graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90074-2openalex-snapshot
Minimally 3-connected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90065-7openalex-snapshot
Contractible edges in 3-connected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90040-5openalex-snapshot
On obstructions to small face covers in planar graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/j.disc.2004.03.007openalex-snapshot
Elements belonging to triads in 3-connected matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2006.05.025openalex-snapshot
Elements belonging to triangles in 3-connected matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2015.08.014openalex-snapshot
The number of elements belonging to triads in 3-connected binary matroids
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.10.006openalex-snapshot
On the number of triangles in 3-connected matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.06.002openalex-snapshot
A constructive characterization of 3-connected triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.05.003openalex-snapshot
On the number of contractible triples in 3-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.02.003openalex-snapshot
On minimally k-connected matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.07.002openalex-snapshot
Spanning trees in 3-connected -minor-free graphs
inferred← citeshttps://doi.org/10.1016/s0021-9800(69)80049-9openalex-snapshot
A theorem on n-connected graphs
inferred← citeshttps://doi.org/10.1016/s0095-8956(02)00043-6openalex-snapshot
Splitting and contractible edges in 4-connected graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70793-3openalex-snapshot
Generalizations of Critical Connectivity of Graphs
inferred← citeshttps://doi.org/10.1017/s0963548301004850openalex-snapshot
On Minimally 3-Connected Binary Matroids
inferred← citeshttps://doi.org/10.1017/s0963548302005497openalex-snapshot
Contractible Elements in Graphs and Matroids
inferred← citeshttps://doi.org/10.1017/s0963548305007443openalex-snapshot
Weakly 3-Connected Graphs
inferred← citeshttps://doi.org/10.1017/s0963548398003617openalex-snapshot
On Vertex-Triads in 3-Connected Binary Matroids
inferred← citeshttps://doi.org/10.1090/s0002-9947-1981-0607106-5openalex-snapshot
On Connectivity in Matroids and Graphs
inferred← citeshttps://doi.org/10.1137/110826345openalex-snapshot
Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
inferred← citeshttps://doi.org/10.1137/21m1454869openalex-snapshot
Small Cocircuits in Minimally Vertically 4-Connected Matroids
inferred← citeshttps://doi.org/10.1137/s0895480198346150openalex-snapshot
Cyclic Chromatic Number of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1201/b16132-30openalex-snapshot
Further Topics in Graph Coloring
inferred← citeshttps://doi.org/10.1201/b16132-42openalex-snapshot
Matroidal Methods in Graph Theory
inferred← citeshttps://doi.org/10.3390/a14010009openalex-snapshot
Constructing Minimally 3-Connected Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1218openalex-snapshot
A note on minimally 3-connected graphs
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.