Minimale \(n\)-fach kantenzusammenhängende Graphen

From MaRDI portal
Revision as of 04:51, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2539992

DOI10.1007/BF01433466zbMath0198.29202OpenAlexW2057250066MaRDI QIDQ2539992

W. Mader

Publication date: 1971

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/162116




Related Items (88)

A survey on multi-loop networks.Super Line-Connectivity Properties of Circulant GraphsOn edge-path eigenvalues of graphsMatching preclusion for vertex-transitive networksOn the lower bound of \(k\)-maximal digraphsMinimum 2-vertex strongly biconnected spanning directed subgraph problemLarge survivable nets and the generalized prismsA bound on 4-restricted edge connectivity of graphsOn the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphsOn reconstruction of normal edge-transitive Cayley graphsBounding \(\ell\)-edge-connectivity in edge-connectivityOn restricted edge-connectivity of vertex-transitive multigraphsThe Connectivity of a Bipartite Graph and Its Bipartite Complementary GraphA Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection NetworksOn maximal 3-restricted edge connectivity and reliability analysis of hypercube networksOn Vertices of Degree n in Minimally n-Edge-Connected GraphsConnectivity preserving trees in k‐connected or k‐edge‐connected graphsOn the spectrum of Wenger graphsEmbedded edge connectivity of \(k\)-ary \(n\)-cubesOn the connectivity of graphs in association schemesOn super 2-restricted and 3-restricted edge-connected vertex transitive graphsUsing semidirect products of groups to build classes of interconnection networksEdge fault tolerance of graphs with respect to super edge connectivityOnk-Maximal Strength DigraphsNOWHERE-ZERO -FLOWS IN TWO FAMILIES OF VERTEX-TRANSITIVE GRAPHSThe edge‐connectivity of vertex‐transitive hypergraphsOn the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphsSuper restricted edge connectivity of regular edge-transitive graphsOn the connectivity of \(p\)-diamond-free vertex transitive graphsNowhere-zero 3-flows in Cayley graphs on supersolvable groupsSuper restricted edge connectivity of regular graphs with two orbitsOn computing of a conditional edge connectivity of alternating group networkCodes from incidence matrices of graphsEdge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphsQuelques problèmes de connexite dans les graphes orientesIndestructive deletions of edges from graphsOn the existence of super edge-connected graphs with prescribed degreesSuper \(s\)-restricted edge-connectivity of vertex-transitive graphsMaximally edge-connected and vertex-connected graphs and digraphs: A surveyEdge-connectivity of regular graphs with two orbitsCharacterizations of strength extremal graphsSufficient conditions for restricted-edge-connectivity to be optimalExtra edge connectivity and isoperimetric edge connectivityConnectivity of half vertex transitive digraphsRestricted connectivity for some interconnection networksSuper-connected edge transitive graphsTree connectivities of Cayley graphs on abelian groups with small degreesClique-inserted-graphs and spectral dynamics of clique-insertingThe connectivity of generalized graph productsA remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graphSuper restricted edge-connectivity of vertex-transitive graphsSemi-hyper-connected edge transitive graphsOn super restricted edge-connectivity of edge-transitive graphsLocally finite graphs with ends: A topological approach. II: ApplicationsSimultaneous well-balanced orientations of graphsExtremal infinite graph theoryOn the edge-connectivity of graphs with two orbits of the same size\(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)Embedded connectivity of ternary \(n\)-cubesOn cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs4-factor-criticality of vertex-transitive graphsSuper-connectivity and hyper-connectivity of vertex transitive bipartite graphsGraph theoryAtoms of cyclic edge connectivity in regular graphs3-Factor-Criticality of Vertex-Transitive GraphsOn k-minimally n-edge-connected graphsSemi-hyper-connected vertex transitive graphsConnectivity of vertex and edge transitive graphsUnnamed ItemOn the sizes of bi-\(k\)-maximal graphsSuper-connected arc-transitive digraphsUnnamed ItemOn the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphsEfficient collective communciation in optical networksEdges of degree \(k\) in minimally restricted \(k\)-edge connected graphsOn cyclic edge-connectivity of transitive graphsEigenvalues and edge-connectivity of regular graphsSymmetric flows and broadcasting in hypercubesOn the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphsAn edge extremal result for subcohesionOn minimally \((n,\lambda)\)-connected graphsOn the conditional edge connectivity of double-orbit graphsSmall separations in vertex-transitive graphsOn the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphsVertex-transitive graphs that have no Hamilton decompositionEvolutionary local search for the edge-biconnectivity augmentation problemExpression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected GraphsThe extremal sizes of arc-maximal \((k, \ell)\)-digraphs



Cites Work




This page was built for publication: Minimale \(n\)-fach kantenzusammenhängende Graphen