On the public citation graph

�ber minimaln-fach zusammenh�ngende, unendliche Graphen und ein Extremalproblem

0 signed · 55 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/bf01304873openalex-snapshot

Ecken vom Gradn in minimalenn-fach zusammenh�ngenden Graphen

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/bf01350321openalex-snapshot

Untersuchungen �ber minimalen-fach zusammenh�ngende Graphen

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.1007/bf02995910openalex-snapshot

Unendliche minimalen-fach zusammenhängende Graphen

inferredcites →https://doi.org/10.1515/crll.1967.228.204openalex-snapshot

Minimally 2-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.22878openalex-snapshot

Connectivity preserving trees in k‐connected or k‐edge‐connected graphs

inferred← citeshttps://doi.org/10.1002/jgt.23046openalex-snapshot

Ear‐decompositions, minimally connected matroids and rigid graphs

inferred← citeshttps://doi.org/10.1002/jgt.23049openalex-snapshot

Uniformly 3‐connected graphs

inferred← citeshttps://doi.org/10.1002/jgt.23286openalex-snapshot

Maximal Spectral Radius of Minimally k‐(Edge)‐Connected Graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190170302openalex-snapshot

On sparse subgraphs preserving connectivity properties

inferred← citeshttps://doi.org/10.1006/jctb.2000.1979openalex-snapshot

On Minimally (n, λ)-Connected Graphs

inferred← citeshttps://doi.org/10.1007/3-540-29297-7openalex-snapshot

Combinatorial Optimization: Theory and Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-29297-7_8openalex-snapshot

Network Flows

inferred← citeshttps://doi.org/10.1007/3-540-60313-1_130openalex-snapshot

On mixed connectivity certificates

inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_8openalex-snapshot

Flots dans les réseaux

inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_8openalex-snapshot

Network Flows

inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_8openalex-snapshot

Netzwerkflüsse

inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_4openalex-snapshot

Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_8openalex-snapshot

Network Flows

inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_8openalex-snapshot

Netzwerkflüsse

inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_8openalex-snapshot

Network Flows

inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_8openalex-snapshot

Network Flows

inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_8openalex-snapshot

Network Flows

inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_8openalex-snapshot

Netzwerkflüsse

inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_8openalex-snapshot

Reti di flusso

inferred← citeshttps://doi.org/10.1007/bf01295482openalex-snapshot

Kantendisjunkte Wege in Graphen

inferred← citeshttps://doi.org/10.1007/bf01304873openalex-snapshot

Ecken vom Gradn in minimalenn-fach zusammenh�ngenden Graphen

inferred← citeshttps://doi.org/10.1007/bf01351600openalex-snapshot

Endlichkeitss�tze f�rk-kritische Graphen

inferred← citeshttps://doi.org/10.1007/bf02950646openalex-snapshot

Zur Struktur minimaln-fach zusammenhängender Graphen

inferred← citeshttps://doi.org/10.1007/s00373-004-0588-6openalex-snapshot

Minimally k-Edge-Connected Directed Graphs of Maximal Size

inferred← citeshttps://doi.org/10.1007/s00373-015-1560-3openalex-snapshot

On Minimally Highly Vertex-Redundantly Rigid Graphs

inferred← citeshttps://doi.org/10.1007/s00493-004-0027-6openalex-snapshot

High Connectivity Keeping Sets In n-Connected Graphs

inferred← citeshttps://doi.org/10.1007/s004930070017openalex-snapshot

NOTE - On Minimizing Symmetric Set Functions

inferred← citeshttps://doi.org/10.1016/0012-365x(82)90018-8openalex-snapshot

Minimally k-connected graphs of low order and maximal size

inferred← citeshttps://doi.org/10.1016/0095-8956(85)90076-0openalex-snapshot

Minimal n-fach zusammenhängende Digraphen

inferred← citeshttps://doi.org/10.1016/0196-6774(88)90015-6openalex-snapshot

Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.023openalex-snapshot

Locally finite graphs with ends: A topological approach, I. Basic theory

inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.027openalex-snapshot

Locally finite graphs with ends: A topological approach, II. Applications

inferred← citeshttps://doi.org/10.1016/j.disc.2010.12.018openalex-snapshot

Extremal infinite graph theory

inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.007openalex-snapshot

Locally finite graphs with ends: A topological approach, III. Fundamental group and homology

inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103626openalex-snapshot

Minimally globally rigid graphs

inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106532openalex-snapshot

A 22k -approximation algorithm for minimum power k edge disjoint st-paths

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.009openalex-snapshot

Constrained surface-level gateway placement for underwater acoustic wireless sensor networks

inferred← citeshttps://doi.org/10.1016/s0195-6698(85)80048-2openalex-snapshot

Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00023-1openalex-snapshot

On mixed connectivity certificates

inferred← citeshttps://doi.org/10.1016/s1571-0653(05)00120-4openalex-snapshot

On minimally 3-connected graphs on a surface

inferred← citeshttps://doi.org/10.1017/s096354830000081xopenalex-snapshot

Minimization Problems for Infiniten-Connected Graphs

inferred← citeshttps://doi.org/10.1017/s096354830200531xopenalex-snapshot

Graphs without Large Complete Minors are Quasi-Random

inferred← citeshttps://doi.org/10.1137/1.9781611970265.ch8openalex-snapshot

8. Network Flows

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.1142/s0219265921500067openalex-snapshot

Cut Star of an Undirected Graph

inferred← citeshttps://doi.org/10.3934/math.2025272openalex-snapshot

Bounds and complexity results of rainbow vertex-disconnection colorings

inferred← citeshttps://doi.org/10.48550/arxiv.0912.4213openalex-snapshot

Locally finite graphs with ends: a topological approach

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.