Bounds on the k-restricted arc connectivity of some bipartite tournaments
From MaRDI portal
Publication:2333161
Recommendations
Cites work
- \(\lambda ^{\prime}\)-optimal digraphs
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
- A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
- Bipartite graphs and digraphs with maximum connectivity
- Component connectivity of hypercubes
- Cycles in digraphs– a survey
- Digraphs
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
- Disjoint cycles in digraphs
- Disjoint directed cycles
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- scientific article; zbMATH DE number 4023324 (Why is no real title available?)
- Large generalized cycles
- On the -connectivity of a graph
- On the acyclic disconnection and the girth
- On the acyclic disconnection of multipartite tournaments
- On the extraconnectivity of graphs
- On the super-restricted arc-connectivity of s-geodetic digraphs
- Restricted arc-connectivity of digraphs
- Restricted arc-connectivity of generalized \(p\)-cycles
- Restricted arc-connectivity of generalized tournaments
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- Vertex disjoint 4-cycles in bipartite tournaments
- Vertex-disjoint cycles in bipartite tournaments
Cited in
(7)- A lower bound on the size of an absorbing set in an arc-coloured tournament
- The \(h\)-restricted connectivity of the generalized hypercubes
- Restricted arc-connectivity in tournaments
- Restricted arc-connectivity of bipartite tournaments
- Restricted arc-connectivity of generalized tournaments
- On k-restricted connectivity of direct product of graphs
- Degree sum conditions for optimal 3-restricted arc-connected digraphs
This page was built for publication: Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333161)
