On the public citation graph
Grad und lokaler Zusammenhang in endlichen Graphen
0 signed · 39 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/bf01350130openalex-snapshot
Existenz gewisser Konfigurationen inn-ges�ttigten Graphen und in Graphen gen�gend gro�er Kantendichte
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.22109openalex-snapshot
Coloring Graphs with Constraints on Connectivity
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferred← citeshttps://doi.org/10.1002/jgt.3190170302openalex-snapshot
On sparse subgraphs preserving connectivity properties
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_16openalex-snapshot
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_130openalex-snapshot
On mixed connectivity certificates
inferred← citeshttps://doi.org/10.1007/978-1-4612-0619-4_3openalex-snapshot
Flows, Connectivity and Matching
inferred← citeshttps://doi.org/10.1007/978-1-4612-9967-7_3openalex-snapshot
Flows, Connectivity and Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-33828-6_8openalex-snapshot
Maximum Generalized Local Connectivity
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/bf01432539openalex-snapshot
Ecken mit starken Zusammenhangseigenschaften in endlichen Graphen
inferred← citeshttps://doi.org/10.1007/bf02579379openalex-snapshot
Degree and local connectivity in digraphs
inferred← citeshttps://doi.org/10.1007/bf02993546openalex-snapshot
kreuzungsfreiea,b-Wege in endlichen Graphen
inferred← citeshttps://doi.org/10.1007/s00373-014-1500-7openalex-snapshot
On Extremal Graphs with at Most $$\ell $$ ℓ Internally Disjoint Steiner Trees Connecting Any $$n-1$$ n - 1 Vertices
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/s004930200000openalex-snapshot
Random Graph Coverings I: General Theory and Graph Connectivity
inferred← citeshttps://doi.org/10.1007/s10114-020-0083-xopenalex-snapshot
The Rainbow Vertex-disconnection in Graphs
inferred← citeshttps://doi.org/10.1007/s40840-021-01125-8openalex-snapshot
Further Results on the Rainbow Vertex-Disconnection of Graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(82)90027-2openalex-snapshot
On n-skein isomorphisms of 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/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.008openalex-snapshot
Sparse connectivity certificates via MA orderings in graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.06.005openalex-snapshot
Extremal connectivity for topological cliques in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.11.003openalex-snapshot
Generalized cut trees for edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.orl.2004.05.008openalex-snapshot
Sparse certificates and removable cycles in -mixed -connected graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(81)80042-xopenalex-snapshot
An Application of Connectivity Theory in Graphs to Factorizations of Elements in Groups
inferred← citeshttps://doi.org/10.1016/s0195-6698(85)80025-1openalex-snapshot
Even Cycles in Directed Graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00023-1openalex-snapshot
On mixed connectivity certificates
inferred← citeshttps://doi.org/10.1023/a:1009804919645openalex-snapshot
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
inferred← citeshttps://doi.org/10.1556/sscmath.40.2003.1-2.12openalex-snapshot
Local edge and local node connectivity in regular graphs
inferred← citeshttps://doi.org/10.37236/6043openalex-snapshot
A Brooks Type Theorem for the Maximum Local Edge Connectivity
inferred← citeshttps://doi.org/10.47443/dml.2024.085openalex-snapshot
Bounds on the largest eigenvalue and energy of the connectivity matrix
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1838openalex-snapshot
A survey on the generalized connectivity of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1210.8021openalex-snapshot
On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices
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.