On directed graphs with an independent covering set

DOI10.1007/BF01788692zbMATH Open0689.05027OpenAlexW2048217665MaRDI QIDQ1264153FDOQ1264153

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

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

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)

Cites Work

• Title not available (Why is that?)
• Solutions of irreflexive relations
• Graphes Noyau-Parfaits
• On kernels and semikernels of digraphs
• Title not available (Why is that?)
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes

Cited In (6)

• Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)
• Expressive power of digraph solvability
• Title not available (Why is that?)
• Finding kernels or solving SAT
• The independent compatible edges topology of directed graphs
• Kernels of digraphs with finitely many ends

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)