The matching-connectivity of a graph
From MaRDI portal
Cites work
- A kind of conditional vertex connectivity of recursive circulants.
- A new approach to finding the extra connectivity of graphs
- Conditional connectivity
- Connectivity of \(k\)-extendable graphs with large \(k\).
- Extraconnectivity of hypercubes
- Graph theory
- Matching extension and minimum degree
- On computing a conditional edge-connectivity of a graph
- On Representatives of Subsets
- On the extraconnectivity of graphs
- Relationship between extra edge connectivity and component edge connectivity for regular graphs
- Restricted arc-connectivity of digraphs
- Restricted connectivity for some interconnection networks
- Structure and substructure connectivity of alternating group graphs
- Structure and substructure connectivity of balanced hypercubes
- Structure and substructure connectivity of circulant graphs and hypercubes
- Structure and substructure connectivity of divide-and-swap cube
- Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
- Structure connectivity and substructure connectivity of bubble-sort star graph networks
- Structure connectivity and substructure connectivity of hypercubes
- Structure connectivity and substructure connectivity of star graphs
- Structure connectivity and substructure connectivity of the crossed cube
- Structure connectivity and substructure connectivity of twisted hypercubes
- Structure connectivity and substructure connectivity of wheel networks
- Structure connectivity of hypercubes
- The \(h\)-restricted connectivity of the generalized hypercubes
- The existence and upper bound for two types of restricted connectivity
- The extra connectivity of the enhanced hypercubes
- TWO THEOREMS IN GRAPH THEORY
Cited in
(3)
This page was built for publication: The matching-connectivity of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7011762)