On the public citation graph
Minimalen-fach kantenzusammenh�ngende Graphen
0 signed · 163 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/bf01220924openalex-snapshot
�ber den Zusammenhang symmetrischer Graphen
inferredcites →https://doi.org/10.1007/bf02993903openalex-snapshot
Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
inferredcites →https://doi.org/10.1007/bfb0060118openalex-snapshot
Critically and minimally n-connected graphs
inferredcites →https://doi.org/10.1016/s0021-9800(69)80049-9openalex-snapshot
A theorem on n-connected graphs
inferredcites →https://doi.org/10.1016/s0021-9800(70)80005-9openalex-snapshot
Connectivity of transitive 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/(sici)1097-0118(200005)34:1<30::aid-jgt4>3.0.co;2-ropenalex-snapshot
Closure and stable Hamiltonian properties in claw-free graphs
inferred← citeshttps://doi.org/10.1002/jgt.20196openalex-snapshot
The 2‐dimensional rigidity of certain families of graphs
inferred← citeshttps://doi.org/10.1002/jgt.21873openalex-snapshot
3‐Factor‐Criticality of Vertex‐Transitive Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22048openalex-snapshot
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
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.23035openalex-snapshot
The edge‐connectivity of vertex‐transitive hypergraphs
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.3190080406openalex-snapshot
Circulants and their connectivities
inferred← citeshttps://doi.org/10.1002/jgt.3190100311openalex-snapshot
On unreliability polynomials and graph connectivity in reliable network synthesis
inferred← citeshttps://doi.org/10.1002/jgt.3190140207openalex-snapshot
The size of strength‐maximal graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190170211openalex-snapshot
On the edge‐toughness of a graph. II
inferred← citeshttps://doi.org/10.1002/mana.19790930116openalex-snapshot
Eine Reduktionsmethode für den Kantenzusammenhang in Graphen
inferred← citeshttps://doi.org/10.1006/jagm.1998.0931openalex-snapshot
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
inferred← citeshttps://doi.org/10.1006/jctb.1993.1039openalex-snapshot
The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph
inferred← citeshttps://doi.org/10.1006/jctb.1999.1917openalex-snapshot
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.1006/jctb.2000.1979openalex-snapshot
On Minimally (n, λ)-Connected Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45365-2_3openalex-snapshot
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_160openalex-snapshot
Efficient collective communication in optical networks
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_2openalex-snapshot
Connectivity of Cayley Digraphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_45openalex-snapshot
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-72588-6_55openalex-snapshot
Connectivity of Connected Bipartite Graphs with Two Orbits
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_5openalex-snapshot
Cayley graphs and interconnection networks
inferred← citeshttps://doi.org/10.1007/bf01238648openalex-snapshot
Ecken vom Innen- und Au�engradn in minimaln-fach kantenzusammenh�ngenden Digraphen
inferred← citeshttps://doi.org/10.1007/bf01304933openalex-snapshot
�ber minimaln-fach zusammenh�ngende, unendliche Graphen und ein Extremalproblem
inferred← citeshttps://doi.org/10.1007/bf01350130openalex-snapshot
Existenz gewisser Konfigurationen inn-ges�ttigten Graphen und in Graphen gen�gend gro�er Kantendichte
inferred← citeshttps://doi.org/10.1007/bf01788663openalex-snapshot
Large fault-tolerant interconnection networks
inferred← citeshttps://doi.org/10.1007/bfb0070398openalex-snapshot
The minimum degree and connectivity of a graph
inferred← citeshttps://doi.org/10.1007/s00026-020-00514-3openalex-snapshot
On Reconstruction of Normal Edge-Transitive Cayley Graphs
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-007-0725-0openalex-snapshot
Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-010-0972-3openalex-snapshot
Superconnected and Hyperconnected Small Degree Transitive Graphs
inferred← citeshttps://doi.org/10.1007/s00373-011-1035-0openalex-snapshot
On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs
inferred← citeshttps://doi.org/10.1007/s00373-013-1359-zopenalex-snapshot
Characterizations of Strength Extremal Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1437-xopenalex-snapshot
Restricted Connectivity for Some Interconnection Networks
inferred← citeshttps://doi.org/10.1007/s00373-019-02052-zopenalex-snapshot
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02468-0openalex-snapshot
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02961-2openalex-snapshot
On the Sizes of Bi-k-Edge-Maximal r-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00493-019-3882-xopenalex-snapshot
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows
inferred← citeshttps://doi.org/10.1007/s10255-022-1095-3openalex-snapshot
On the Sizes of k-edge-maximal r-uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10623-011-9594-xopenalex-snapshot
Codes from incidence matrices of graphs
inferred← citeshttps://doi.org/10.1007/s10801-024-01335-wopenalex-snapshot
Nowhere-zero 3-flows in nilpotently vertex-transitive graphs
inferred← citeshttps://doi.org/10.1007/s10801-025-01400-yopenalex-snapshot
Invariant systems of weighted representatives
inferred← citeshttps://doi.org/10.1007/s10878-010-9304-zopenalex-snapshot
Super cyclically edge connected transitive graphs
inferred← citeshttps://doi.org/10.1007/s10878-014-9759-4openalex-snapshot
Atoms of cyclic edge connectivity in regular graphs
inferred← citeshttps://doi.org/10.1007/s10878-020-00522-2openalex-snapshot
On the sizes of bi-k-maximal graphs
inferred← citeshttps://doi.org/10.1007/s11425-014-4794-2openalex-snapshot
Super s-restricted edge-connectivity of vertex-transitive graphs
inferred← citeshttps://doi.org/10.1007/s40840-015-0147-8openalex-snapshot
Tree Connectivities of Cayley Graphs on Abelian Groups with Small Degrees
inferred← citeshttps://doi.org/10.1007/s40840-015-0286-yopenalex-snapshot
On Cyclic Edge-Connectivity and Super-Cyclic Edge-Connectivity of Double-Orbit Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90198-xopenalex-snapshot
On k-minimally n-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90445-lopenalex-snapshot
A remark on the number of vertices of degree k in a minimally k-edge-connected graph
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(81)90085-xopenalex-snapshot
Quelques problèmes de connexité dans les graphes orientés
inferred← citeshttps://doi.org/10.1016/0095-8956(85)90087-5openalex-snapshot
An edge extremal result for subcohesion
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00131-vopenalex-snapshot
Large survivable nets and the generalized prisms
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/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.amc.2010.07.073openalex-snapshot
On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
inferred← citeshttps://doi.org/10.1016/j.amc.2011.11.111openalex-snapshot
Super restricted edge connectivity of regular graphs with two orbits
inferred← citeshttps://doi.org/10.1016/j.amc.2017.08.006openalex-snapshot
Connectivity of half vertex transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.014openalex-snapshot
Super-connected edge transitive graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.018openalex-snapshot
Super-connected arc-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.033openalex-snapshot
Edge fault tolerance of graphs with respect to super edge connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.016openalex-snapshot
On the connectivity of p -diamond-free vertex transitive graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.004openalex-snapshot
Super restricted edge connectivity of regular edge-transitive graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.02.001openalex-snapshot
Matching preclusion for vertex-transitive networks
inferred← citeshttps://doi.org/10.1016/j.dam.2019.12.014openalex-snapshot
Using semidirect products of groups to build classes of interconnection networks
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.003openalex-snapshot
On the extremal sizes of maximal graphs without ( k + 1 ) -connected subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.011openalex-snapshot
Bounding ℓ -edge-connectivity in edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2024.11.009openalex-snapshot
On vertices of outdegree k in minimally k -arc-connected digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.042openalex-snapshot
Higher order matching preclusion for regular interconnection networks
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.008openalex-snapshot
A survey on the vertex-(edge-) k -maximal graphs and the k -vertex-(edge-)connected graphs with redundant subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.031openalex-snapshot
Minimum embedded-link-cut split k -ary n -cubes
inferred← citeshttps://doi.org/10.1016/j.disc.2004.08.011openalex-snapshot
Super restricted edge-connectivity of vertex-transitive graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.019openalex-snapshot
Semi-hyper-connected edge transitive graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.10.016openalex-snapshot
A bound on 4-restricted edge connectivity of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.01.016openalex-snapshot
Sufficient conditions for restricted-edge-connectivity to be optimal
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.035openalex-snapshot
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.040openalex-snapshot
Edge-connectivity of regular graphs with two orbits
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.066openalex-snapshot
Extra edge connectivity and isoperimetric edge connectivity
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.031openalex-snapshot
Semi-hyper-connected vertex transitive graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.006openalex-snapshot
Edges of degree k in minimally restricted k -edge connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.019openalex-snapshot
On cyclic edge-connectivity of transitive graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.04.024openalex-snapshot
On super restricted edge-connectivity of edge-transitive 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.04.016openalex-snapshot
On the edge-connectivity of graphs with two orbits of the same size
inferred← citeshttps://doi.org/10.1016/j.disc.2011.08.021openalex-snapshot
On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.025openalex-snapshot
On the existence of super edge-connected graphs with prescribed degrees
inferred← citeshttps://doi.org/10.1016/j.disc.2016.04.007openalex-snapshot
On the lower bound of k -maximal digraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.042openalex-snapshot
Small separations in vertex-transitive graphs
inferred← citeshttps://doi.org/10.1016/j.future.2017.09.008openalex-snapshot
A conditional edge connectivity of double-orbit networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.001openalex-snapshot
-Optimally half vertex transitive graphs with regularity k
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.03.014openalex-snapshot
The connectivity of generalized graph products
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106328openalex-snapshot
Embedded edge connectivity of k-ary n-cubes
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.jcss.2020.07.002openalex-snapshot
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2023.105852openalex-snapshot
Nowhere-zero 3-flows in Cayley graphs on supersolvable groups
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.01.002openalex-snapshot
Simultaneous well-balanced orientations of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.02.008openalex-snapshot
On the spectrum of Wenger graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.05.007openalex-snapshot
Vertex-transitive graphs that have no Hamilton decomposition
inferred← citeshttps://doi.org/10.1016/j.jebo.2019.03.011openalex-snapshot
The common enemy effect under strategic network formation and disruption
inferred← citeshttps://doi.org/10.1016/j.jmaa.2008.08.036openalex-snapshot
Clique-inserted-graphs and spectral dynamics of clique-inserting
inferred← citeshttps://doi.org/10.1016/j.laa.2009.08.029openalex-snapshot
Eigenvalues and edge-connectivity of regular graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2025.10.023openalex-snapshot
Spectral conditions for the maximum subgraph edge-connectivity of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.016openalex-snapshot
Embedded connectivity of ternary n-cubes
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00285-xopenalex-snapshot
Evolutionary local search for the edge-biconnectivity augmentation problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00391-8openalex-snapshot
Connectivity of vertex and edge transitive graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70504-1openalex-snapshot
A Reduction Method for Edge-Connectivity in Graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00341-3openalex-snapshot
A survey on multi-loop networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00018-8openalex-snapshot
Efficient collective communication in optical networks
inferred← citeshttps://doi.org/10.1017/s0004972722000922openalex-snapshot
NOWHERE-ZERO -FLOWS IN TWO FAMILIES OF VERTEX-TRANSITIVE GRAPHS
inferred← citeshttps://doi.org/10.1017/s0963548300001498openalex-snapshot
On Vertices of Degree n in Minimally n -Edge-Connected Graphs
inferred← citeshttps://doi.org/10.1023/a:1019135804943openalex-snapshot
Removing edges from hypercubes to obtain vertex‐symmetric networks with small diameter
inferred← citeshttps://doi.org/10.1080/00207160.2013.856419openalex-snapshot
On restricted edge-connectivity of vertex-transitive multigraphs
inferred← citeshttps://doi.org/10.1080/03081087.2016.1277689openalex-snapshot
On computing of a conditional edge connectivity of alternating group network
inferred← citeshttps://doi.org/10.1080/03081087.2020.1820934openalex-snapshot
On edge-path eigenvalues of graphs
inferred← citeshttps://doi.org/10.1088/1751-8113/43/31/315004openalex-snapshot
Inductive construction of 2-connected graphs for calculating the virial coefficients
inferred← citeshttps://doi.org/10.1093/imrn/rnad222openalex-snapshot
Existence of a Percolation Threshold on Finite Transitive Graphs
inferred← citeshttps://doi.org/10.1093/imrn/rnaf303openalex-snapshot
Connectivity versus Lin–Lu–Yau Curvature
inferred← citeshttps://doi.org/10.1109/drcn.2003.1275365openalex-snapshot
A reliable architecture for networks under stress
inferred← citeshttps://doi.org/10.1109/icpp.1998.708457openalex-snapshot
Pancake problems with restricted prefix reversals and some corresponding Cayley networks
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354488openalex-snapshot
High-reliability architectures for networks under stress
inferred← citeshttps://doi.org/10.1109/jsac.2004.835750openalex-snapshot
High-Reliability Topological Architectures for Networks Under Stress
inferred← citeshttps://doi.org/10.1109/qrs-c55045.2021.00128openalex-snapshot
A Novel View: Edge is Operimetric Methods and Reliability Evaluation of Several kinds of Conditional Edge-connectivity of Interconnection Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548488openalex-snapshot
Approximating minimum-size k-connected spanning subgraphs via matching
inferred← citeshttps://doi.org/10.1109/tr.1986.4335424openalex-snapshot
Synthesis of reliable networks - a survey
inferred← citeshttps://doi.org/10.1111/jpet.12168openalex-snapshot
Strategic Network Disruption and Defense
inferred← citeshttps://doi.org/10.1112/jlms.70527openalex-snapshot
Edge‐connectivity of graphs with non‐negative Bakry–Émery curvature and amply regular graphs
inferred← citeshttps://doi.org/10.1137/0403044openalex-snapshot
Vertex Transitivity and Super Line Connectedness
inferred← citeshttps://doi.org/10.1137/0607011openalex-snapshot
Super Line-Connectivity Properties of Circulant Graphs
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.1137/s009753979833920xopenalex-snapshot
Approximating Minimum-Size k -Connected Spanning Subgraphs via Matching
inferred← citeshttps://doi.org/10.1142/s0129626420400058openalex-snapshot
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph
inferred← citeshttps://doi.org/10.1142/s0129626420400095openalex-snapshot
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks
inferred← citeshttps://doi.org/10.1142/s0219265921420238openalex-snapshot
The Arc-Connectivity of 3-Regular Digraphs with Two Orbits
inferred← citeshttps://doi.org/10.12677/orf.2023.135487openalex-snapshot
The Main Eigenvalues of Signed Wenger Graphs
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3238276/v1openalex-snapshot
Minimum edge cuts of hypercubes and k-ary n-cubes leaving every fault-free node in given subnetworks
inferred← citeshttps://doi.org/10.2139/ssrn.4903711openalex-snapshot
On Vertices of Outdegree K In Minimally K-Arc-Connected Digraphs
inferred← citeshttps://doi.org/10.2139/ssrn.7380669openalex-snapshot
Characterization of the structure of k-edge-maximal graphs
inferred← citeshttps://doi.org/10.33915/etd.5104openalex-snapshot
A Study of Arc Strong Connectivity of Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09579openalex-snapshot
Exponentially many nowhere-zero $Z_3$-, $Z_4$-, and $Z_6$-flows
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06959openalex-snapshot
Cometric Association Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.2003.00942openalex-snapshot
Large highly connected subgraphs in graphs with linear average degree
inferred← citeshttps://doi.org/10.58088/k8jr-sz91openalex-snapshot
Combinatorial and spectral properties of graphs and association schemes
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.