On directed graphs with an independent covering set

DOI10.1007/BF01788692zbMath0689.05027OpenAlexW2048217665MaRDI QIDQ1264153

Robert E. Woodrow, Eric C. Milner

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788692

zbMATH Keywords

digraphdegreedirected graphdirected cyclesindependent covering set

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Kernels of digraphs with finitely many ends ⋮ Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph) ⋮ Expressive power of digraph solvability ⋮ Finding kernels or solving SAT

Cites Work

• On kernels and semikernels of digraphs
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• Solutions of irreflexive relations
• Graphes Noyau-Parfaits
• Unnamed Item
• Unnamed Item

This page was built for publication: On directed graphs with an independent covering set