Connectivity of graphs with given girth pair
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- Connectivity of Regular Directed Graphs with Small Diameters
- Maximally connected digraphs
- On the order and size of s-geodetic digraphs with given connectivity
- Regular graphs with given girth pair
- Sufficient conditions for maximally connected dense graphs
Cited in
(10)- On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)
- Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
- Graphs and digraphs with given girth and connectivity
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On the connectivity of \(p\)-diamond-free graphs
- On local connectivity of graphs with given clique number
- Regular graphs with given girth pair
- The g-component connectivity of graphs
- On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
- scientific article; zbMATH DE number 6539682 (Why is no real title available?)
This page was built for publication: Connectivity of graphs with given girth pair
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864156)