Pages that link to "Item:Q1292866"
From MaRDI portal
The following pages link to The acyclic disconnection of a digraph (Q1292866):
Displaying 13 items.
- The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments (Q393468) (← links)
- On the acyclic disconnection of multipartite tournaments (Q427897) (← links)
- The minimum feedback arc set problem and the acyclic disconnection for graphs (Q526233) (← links)
- A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments (Q960957) (← links)
- Circulant tournaments of prime order are tight (Q998344) (← links)
- A family of bipartite circulant tournaments with acyclic disconnection 3 (Q2166245) (← links)
- On the acyclic disconnection and the girth (Q2345594) (← links)
- Disproof of a conjecture of Neumann-Lara (Q2409837) (← links)
- Infinite families of -dichromatic vertex critical circulant tournaments (Q3439577) (← links)
- On a Conjecture of Víctor Neumann-Lara (Q3503552) (← links)
- On the minimum size of tight hypergraphs (Q4014271) (← links)
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al.. (Q6494939) (← links)
- Bounds on the acyclic disconnection of a digraph (Q6655965) (← links)