The acyclic disconnection of a digraph

DOI10.1016/S0012-365X(99)90123-1zbMath0928.05033MaRDI QIDQ1292866

Víctor Neumann-Lara

Publication date: 9 January 2000

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

zbMATH Keywords

invariantdigraphsacyclic disconnectioncirculant tournaments

Mathematics Subject Classification ID

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

Related Items (11)

A family of bipartite circulant tournaments with acyclic disconnection 3 ⋮ On the minimum size of tight hypergraphs ⋮ Disproof of a conjecture of Neumann-Lara ⋮ The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments ⋮ On a Conjecture of Víctor Neumann-Lara ⋮ On the acyclic disconnection of multipartite tournaments ⋮ The minimum feedback arc set problem and the acyclic disconnection for graphs ⋮ A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments ⋮ Circulant tournaments of prime order are tight ⋮ On the acyclic disconnection and the girth ⋮ Infinite families of -dichromatic vertex critical circulant tournaments

Cites Work

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

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