On directed graphs with an independent covering set
type: Item
instance of: scholarly article
title: On directed graphs with an independent covering set
zbMATH Open document ID: 0689.05027
DOI: 10.1007/BF01788692
author: R. E. Woodrow
author: Eric C. Milner
published in: Graphs and Combinatorics
publication date: 1989-01-01T00:00:00Z
review text: It is shown that if a directed graph contains no odd directed cycle and, for all but finitely many nodes, either the in-degrees are finite or the out-degrees are at most one, then the directed graph contains an independent covering set. An example is given to show that a countable directed graph having no directed cycles, each of its nodes has at most out-degree two, has no independent covering set.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4128835
zbMATH Keywords: digraph
zbMATH Keywords: directed graph
zbMATH Keywords: independent covering set
zbMATH Keywords: directed cycles
zbMATH Keywords: degree
MaRDI profile type: Publication
cites work: Q5615282
cites work: Graphes Noyau-Parfaits
cites work: Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
cites work: On kernels and semikernels of digraphs
cites work: Solutions of irreflexive relations
cites work: Q5844986
full work available at URL: https://doi.org/10.1007/bf01788692
OpenAlex ID: W2048217665
description: scientific article; zbMATH DE number 4128835