Spectral threshold for extremal cyclic edge-connectivity
From MaRDI portal
Publication:2053673
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- scientific article; zbMATH DE number 2123255 (Why is no real title available?)
- scientific article; zbMATH DE number 3243269 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- Algebraic Graph Theory
- An efficient algorithm for cyclic edge connectivity of regular graphs.
- Characterization of graphs with infinite cyclic edge connectivity
- Conditional connectivity
- Disconnecting strongly regular graphs
- Eigenvalues and edge-connectivity of regular graphs
- Extraconnectivity of graphs with large girth
- Integer flows and cycle covers
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- On cyclic edge-connectivity of transitive graphs
- On n-extendable graphs
- On several sorts of connectivity
- Some Results Concerning the Structure of Graphs
- Spectral bounds for the connectivity of regular graphs with given order
- The Moore bound for irregular graphs
- The cyclic edge-connectivity of strongly regular graphs
- The existence and upper bound for two types of restricted connectivity
This page was built for publication: Spectral threshold for extremal cyclic edge-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053673)