Minimale n-fach kantenzusammenhängende Graphen
From MaRDI portal
Publication:2539992
DOI10.1007/BF01433466zbMATH Open0198.29202OpenAlexW2057250066MaRDI QIDQ2539992FDOQ2539992
Authors: W. Mader 
Publication date: 1971
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/162116
Cites Work
Cited In (92)
- On the conditional edge connectivity of double-orbit graphs
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- On the spectrum of Wenger graphs
- A bound on 4-restricted edge connectivity of graphs
- Super restricted edge connectivity of regular edge-transitive graphs
- Title not available (Why is that?)
- On edge-path eigenvalues of graphs
- Quelques problèmes de connexite dans les graphes orientes
- Edge fault tolerance of graphs with respect to super edge connectivity
- On super restricted edge-connectivity of edge-transitive graphs
- Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
- Semi-hyper-connected vertex transitive graphs
- Efficient collective communciation in optical networks
- On minimally \((n,\lambda)\)-connected graphs
- Codes from incidence matrices of graphs
- Minimum 2-vertex strongly biconnected spanning directed subgraph problem
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On the connectivity of \(p\)-diamond-free vertex transitive graphs
- Super restricted edge connectivity of regular graphs with two orbits
- Sufficient conditions for restricted-edge-connectivity to be optimal
- On cyclic edge-connectivity of transitive graphs
- Super-connected arc-transitive digraphs
- Super Line-Connectivity Properties of Circulant Graphs
- Indestructive deletions of edges from graphs
- Matching preclusion for vertex-transitive networks
- 4-factor-criticality of vertex-transitive graphs
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
- On the lower bound of \(k\)-maximal digraphs
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- Edge-connectivity of regular graphs with two orbits
- Super-connected edge transitive graphs
- Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
- Eigenvalues and edge-connectivity of regular graphs
- \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)
- Connectivity of vertex and edge transitive graphs
- A survey on multi-loop networks.
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
- Symmetric flows and broadcasting in hypercubes
- Semi-hyper-connected edge transitive graphs
- On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
- NOWHERE-ZERO -FLOWS IN TWO FAMILIES OF VERTEX-TRANSITIVE GRAPHS
- Super restricted edge-connectivity of vertex-transitive graphs
- Simultaneous well-balanced orientations of graphs
- On k-minimally n-edge-connected graphs
- The connectivity of generalized graph products
- On the connectivity of graphs in association schemes
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
- The connectivity of a bipartite graph and its bipartite complementary graph
- Connectivity of half vertex transitive digraphs
- Tree connectivities of Cayley graphs on abelian groups with small degrees
- Extremal infinite graph theory
- On \(k\)-maximal strength digraphs
- On the edge-connectivity of graphs with two orbits of the same size
- Locally finite graphs with ends: A topological approach. II: Applications
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- Large survivable nets and the generalized prisms
- Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
- On Vertices of Degree n in Minimally n-Edge-Connected Graphs
- Characterizations of strength extremal graphs
- On computing of a conditional edge connectivity of alternating group network
- 3-factor-criticality of vertex-transitive graphs
- An edge extremal result for subcohesion
- Restricted connectivity for some interconnection networks
- A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph
- Extra edge connectivity and isoperimetric edge connectivity
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- Atoms of cyclic edge connectivity in regular graphs
- Evolutionary local search for the edge-biconnectivity augmentation problem
- The edge‐connectivity of vertex‐transitive hypergraphs
- On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs
- On the existence of super edge-connected graphs with prescribed degrees
- On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
- The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
- Connected odd factors of graphs
- Vertex-transitive graphs that have no Hamilton decomposition
- Nowhere-zero 3-flows in nilpotently vertex-transitive graphs
- On restricted edge-connectivity of vertex-transitive multigraphs
- A brief account on the development and future research directions of connectivity properties of interconnection networks
- Embedded connectivity of ternary \(n\)-cubes
- Connectivity graph-codes
- Graph theory
- Small separations in vertex-transitive graphs
- Nowhere-zero 3-flows in Cayley graphs on supersolvable groups
- On reconstruction of normal edge-transitive Cayley graphs
- Bounding \(\ell\)-edge-connectivity in edge-connectivity
- Embedded edge connectivity of \(k\)-ary \(n\)-cubes
- On vertices of outdegree \(k\) in minimally \(k\)-arc-connected digraphs
- Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
- Using semidirect products of groups to build classes of interconnection networks
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- On the sizes of bi-\(k\)-maximal graphs
This page was built for publication: Minimale \(n\)-fach kantenzusammenhängende Graphen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2539992)
