On the acyclic disconnection and the girth

DOI10.1016/j.dam.2015.01.025zbMath1311.05071OpenAlexW2050849188MaRDI QIDQ2345594

Camino Balbuena, Mika Olsen

Publication date: 22 May 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.025

zbMATH Keywords

projective planesdigraphsgirthacyclic disconnectionsemigirth

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

A family of bipartite circulant tournaments with acyclic disconnection 3 ⋮ The minimum feedback arc set problem and the acyclic disconnection for graphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments

Cites Work

• Unnamed Item
• Restricted arc-connectivity of generalized \(p\)-cycles
• On the acyclic disconnection of multipartite tournaments
• Circulant tournaments of prime order are tight
• The acyclic disconnection of a digraph
• Line Digraph Iterations and the (d, k) Digraph Problem
• On a Conjecture of Víctor Neumann-Lara
• Maximally connected digraphs
• A class of tight circulant tournaments
• Superconnected digraphs and graphs with small conditional diameters
• Dense bipartite digraphs
• Infinite families of tight regular tournaments

This page was built for publication: On the acyclic disconnection and the girth