The acyclic disconnection of a digraph

DOI10.1016/S0012-365X(99)90123-1zbMATH Open0928.05033MaRDI QIDQ1292866FDOQ1292866

Authors V. Neumann-Lara

Publication date 9 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphsinvariantacyclic disconnectioncirculant tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the acyclic disconnection of multipartite tournaments
• On the acyclic disconnection and the girth
• A family of bipartite circulant tournaments with acyclic disconnection 3
• The minimum feedback arc set problem and the acyclic disconnection for graphs
• The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments

Cites work

• scientific article; zbMATH DE number 3918396 (Why is no real title available?)
• scientific article; zbMATH DE number 3687449 (Why is no real title available?)
• scientific article; zbMATH DE number 1156581 (Why is no real title available?)
• Cycles of Each Length in Regular Tournaments
• Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
• Graph theory
• On the minimum size of tight hypergraphs
• Paths and cycles in extended and decomposable digraphs
• Some extremal results in cochromatic and dichromatic theory
• The 3 and 4-dichromatic tournaments of minimum order
• The dichromatic number of a digraph
• Vertex critical 4-dichromatic circulant tournaments
• Vertex critical r-dichromatic tournaments

Cited in

(15)

• A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments
• Disproof of a conjecture of Neumann-Lara
• The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments
• Bounds on the acyclic disconnection of a digraph
• The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al..
• On the acyclic disconnection of multipartite tournaments
• Circulant tournaments of prime order are tight
• On the acyclic disconnection and the girth
• On a Conjecture of Víctor Neumann-Lara
• Completely Disconnecting the Complete Graph
• Infinite families of -dichromatic vertex critical circulant tournaments
• The minimum feedback arc set problem and the acyclic disconnection for graphs
• Decycling bipartite tournaments by deleting arcs.
• On the minimum size of tight hypergraphs
• A family of bipartite circulant tournaments with acyclic disconnection 3

This page was built for publication: The acyclic disconnection of a digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292866)