On graphs with equal edge connectivity and minimum degree
From MaRDI portal
Cites work
- A Graph-Theoretic Approach to a Communications Problem
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- On graphs with equal edge-connectivity and minimum degree
- Results on the edge-connectivity of graphs
- Studies on directed graphs. I, II
Cited in
(12)- Degree sequences of random graphs
- Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Local-edge-connectivity in digraphs and oriented graphs
- Sufficient conditions for maximally restricted edge connected graphs
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- On the edge-connectivity of C₄-free graphs
- Maximally edge‐connected realizations and Kundu's k k‐factor theorem
- On the size of linear r-uniform hypergraphs and sufficient conditions for maximally edge-connected hypergraphs
- A binomial approximation method for the Ising model
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
This page was built for publication: On graphs with equal edge connectivity and minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1134165)
