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)

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

zbMATH Keywords

digraphsinvariantacyclic disconnectioncirculant tournaments

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

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

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)