The acyclic disconnection of a digraph
type: Item
instance of: scholarly article
title: The acyclic disconnection of a digraph
zbMATH Open document ID: 0928.05033
DOI: 10.1016/S0012-365X(99)90123-1
published in: Discrete Mathematics
publication date: 2000-01-09T00:00:00Z
review text: The author introduces a new invariant of digraphs: the acyclic disconnection of a digraph \(D\) is the minimum number of connected components of the subgraphs obtained from \(D\) by deleting an acyclic set of arcs. Some results are obtained about this invariant, in general, and for circulant tournaments, in particular.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1322042
zbMATH Keywords: invariant
zbMATH Keywords: digraphs
zbMATH Keywords: acyclic disconnection
zbMATH Keywords: circulant tournaments
author: V. Neumann-Lara
reviewed by: G. Gutin
MaRDI profile type: Publication
cites work: Cycles of Each Length in Regular Tournaments
cites work: On the minimum size of tight hypergraphs
cites work: Q4390605
cites work: Paths and cycles in extended and decomposable digraphs
cites work: Q5422499
cites work: Q3882513
cites work: Some extremal results in cochromatic and dichromatic theory
cites work: Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
cites work: The dichromatic number of a digraph
cites work: Q3693540
cites work: The 3 and 4-dichromatic tournaments of minimum order
cites work: Vertex critical 4-dichromatic circulant tournaments
cites work: Vertex critical r-dichromatic tournaments
description: scientific article; zbMATH DE number 1322042