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