Edge‐connectivity in p‐partite graphs
From MaRDI portal
Publication:4710367
Cited in
(6)- Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
- Maximally connected \(p\)-partite uniform hypergraphs
- On the edge-connectivity of \(C_4\)-free graphs
- On connectivity of the cartesian product of two graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Local-edge-connectivity in digraphs and oriented graphs
This page was built for publication: Edge‐connectivity in p‐partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4710367)