Bounds on the k-restricted arc connectivity of some bipartite tournaments
From MaRDI portal
Publication:2333161
DOI10.1016/J.AMC.2018.02.038zbMATH Open1427.05095OpenAlexW2793463314MaRDI QIDQ2333161FDOQ2333161
Authors: C. Balbuena, Diego González-Moreno, M. Olsen 
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
Recommendations
Cites Work
- On the extraconnectivity of graphs
- Digraphs
- Restricted arc-connectivity of digraphs
- Large generalized cycles
- On the \(\ell\)-connectivity of a graph
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- On the acyclic disconnection of multipartite tournaments
- Bipartite graphs and digraphs with maximum connectivity
- Cycles in digraphs– a survey
- A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
- Restricted arc-connectivity of generalized \(p\)-cycles
- On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- \(\lambda ^{\prime}\)-optimal digraphs
- Title not available (Why is that?)
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
- Restricted arc-connectivity of generalized tournaments
- On the acyclic disconnection and the girth
- Disjoint cycles in digraphs
- Disjoint directed cycles
- Vertex-disjoint cycles in bipartite tournaments
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
- Component connectivity of hypercubes
- Vertex disjoint 4-cycles in bipartite tournaments
Cited In (6)
- A lower bound on the size of an absorbing set in an arc-coloured tournament
- On k-restricted connectivity of direct product of graphs
- 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
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)
