Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
From MaRDI portal
Publication:2333161
DOI10.1016/j.amc.2018.02.038zbMath1427.05095OpenAlexW2793463314MaRDI QIDQ2333161
Mika Olsen, Diego González-Moreno, Camino Balbuena
Publication date: 12 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.02.038
Related Items (2)
On k-restricted connectivity of direct product of graphs ⋮ The \(h\)-restricted connectivity of the generalized hypercubes
Cites Work
- Unnamed Item
- Unnamed Item
- Restricted arc-connectivity of generalized \(p\)-cycles
- On the acyclic disconnection of multipartite tournaments
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
- Disjoint cycles in digraphs
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- \(\lambda ^{\prime}\)-optimal digraphs
- On the \(\ell\)-connectivity of a graph
- Disjoint directed cycles
- Large generalized cycles
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- Vertex disjoint 4-cycles in bipartite tournaments
- On the extraconnectivity of graphs
- Bipartite graphs and digraphs with maximum connectivity
- On the acyclic disconnection and the girth
- Restricted arc-connectivity of digraphs
- Component connectivity of hypercubes
- A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
- Cycles in digraphs– a survey
- On the super‐restricted arc‐connectivity of s ‐geodetic digraphs
- Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
- Digraphs
- Vertex-disjoint cycles in bipartite tournaments
This page was built for publication: Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
