On directed graphs with an independent covering set

DOI10.1007/BF01788692MaRDI QIDQ1264153zbMATHOpenAlexFDO

Authors R. 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

digraphdirected graphdegreedirected cyclesindependent covering set

Mathematics Subject Classification ID

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

Recommendations

• Decomposition tree and indecomposable coverings
• Independent domination in directed graphs
• Covering directed graphs by in-trees
• Covering Directed Graphs by In-Trees
• Independent directed triangles in a directed graph

Cites work

• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Graphes Noyau-Parfaits
• On kernels and semikernels of digraphs
• Solutions of irreflexive relations
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes

Cited in

(7)

• Finding kernels or solving SAT
• Directed graphs from exact covering systems
• Expressive power of digraph solvability
• Kernels of digraphs with finitely many ends
• The independent compatible edges topology of directed graphs
• scientific article; zbMATH DE number 1208730 (Why is no real title available?)
• Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264153)