On the public citation graph
Endlichkeitss�tze f�rk-kritische Graphen
0 signed · 42 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/bf01222585openalex-snapshot
Eine Eigenschaft der Atome endlicher Graphen
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/bfb0060118openalex-snapshot
Critically and minimally n-connected graphs
inferredcites →https://doi.org/10.1016/s0021-9800(70)80005-9openalex-snapshot
Connectivity of transitive graphs
inferredcites →https://doi.org/10.1016/s0095-8956(78)80012-4openalex-snapshot
Über n-fach zusammenhängende Eckenmengen in Graphen
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.10164openalex-snapshot
Proof of Mader's conjecture on k‐critical n‐connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.20465openalex-snapshot
Connectivity keeping paths in k‐connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.23278openalex-snapshot
On the Minimum Degree of Minimally t‐Tough, Claw‐Free Graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190130412openalex-snapshot
On critically connected digraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190200304openalex-snapshot
Fragments in kcritical n‐connected graphs
inferred← citeshttps://doi.org/10.1006/jctb.1998.1842openalex-snapshot
Contractible Non-edges in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1006/jctb.2002.2129openalex-snapshot
On k-con-Critically n-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_13openalex-snapshot
On Infinite n-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-006-0672-1openalex-snapshot
There Exist Highly Critically Connected Graphs of Diameter Three
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90263-0openalex-snapshot
On critically h-connected simple graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90029-2openalex-snapshot
On a conjecture of entringer and slater
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90216-6openalex-snapshot
Generalizations of critical connectivity of graphs
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)90054-8openalex-snapshot
Über (k + 1)-kritisch (2k + 1)-fach zusammenhängende Graphen
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.032openalex-snapshot
High connectivity keeping sets in graphs and digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.12.018openalex-snapshot
Extremal infinite graph theory
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.014openalex-snapshot
A connected subgraph maintaining high connectivity
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.058openalex-snapshot
High connectivity keeping connected subgraph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70793-3openalex-snapshot
Generalizations of Critical Connectivity of Graphs
inferred← citeshttps://doi.org/10.1109/focs.2013.12openalex-snapshot
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
inferred← citeshttps://doi.org/10.1137/110855910openalex-snapshot
An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem
inferred← citeshttps://doi.org/10.1137/120902847openalex-snapshot
Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs
inferred← citeshttps://doi.org/10.1137/s0097539701392287openalex-snapshot
An Approximation Algorithm for the Minimum-Cost k -Vertex Connected Subgraph
inferred← citeshttps://doi.org/10.1137/s0097539703435753openalex-snapshot
Approximating k -node Connected Subgraphs via Critical Graphs
inferred← citeshttps://doi.org/10.1145/1007352.1007381openalex-snapshot
Approximation algorithm for k-node connected subgraphs via critical graphs
inferred← citeshttps://doi.org/10.1145/1374376.1374401openalex-snapshot
An o(log 2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
inferred← citeshttps://doi.org/10.1145/1374376.1374403openalex-snapshot
Network design for vertex connectivity
inferred← citeshttps://doi.org/10.1145/509907.509955openalex-snapshot
Approximation algorithms for minimum-cost k-vertex connected subgraphs
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.