Domination in Digraphs
From MaRDI portal
Publication:3384119
DOI10.1007/978-3-030-58892-2_13zbMath1479.05270OpenAlexW3158599441MaRDI QIDQ3384119
Stephen T. Hedetniemi, Teresa W. Haynes, Michael A. Henning
Publication date: 14 December 2021
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_13
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Cites Work
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\)
- Domination in transitive colorings of tournaments
- On domination number of Cartesian product of directed paths
- Directed domination in oriented graphs
- On the difference of the domination number of a digraph and of its reverse
- Efficient total domination in digraphs
- Signed total Roman domination in digraphs
- A new generalization of kernels in digraphs
- A greedy partition lemma for directed domination
- On kernels and semikernels of digraphs
- Domination in a digraph and in its reverse
- On domination number of Cartesian product of directed cycles
- A survey of selected recent results on total domination in graphs
- A counterexample to a conjecture of Meyniel on kernel-perfect graphs
- On monochromatic paths in edge-coloured digraphs
- Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
- Relations between packing and covering numbers of a tree
- On the out-domination and in-domination numbers of a digraph
- The oriented cycle game
- Domination graphs of regular tournaments
- Domination and fractional domination in digraphs
- On the existence of 3- and 4-kernels in digraphs
- Bounds on the domination number of a digraph
- Domination in tournaments
- On the domination number of Cartesian product of two directed cycles
- Game domination number
- About quasi-kernels in a digraph
- Total domination and the Caccetta-Häggkvist conjecture
- Domination number of Cartesian products of directed cycles
- Kernels in random graphs
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture
- Perfect graphs, kernels, and cores of cooperative games
- On the complexity of the 3-kernel problem in some classes of digraphs
- On the existence of \((k, l)\)-kernels in digraphs with a given circumference
- Tight lower bounds on the size of a maximum matching in a regular graph
- Dominating sets in \(k\)-majority tournaments.
- On domination of Cartesian product of directed cycles: Results for certain equivalence classes of lengths
- THE DOMINATION NUMBER OF STRONG PRODUCT OF DIRECTED CYCLES
- A sufficient condition for a digraph to be kernel-perfect
- Graphes Noyau-Parfaits
- The domination and competition graphs of a tournament
- Short proofs of classical theorems
- Total Domination in Graphs
- Total domination in digraphs
- A note on lower bounds for the total domination number of digraphs
- Twin domination and twin irredundance in digraphs
- An inequality for the chromatic number of a graph
- Dominating Set and Converse Dominating Set of a Directed Graph
- On a Problem in Graph Theory
- On weakly ordered systems
- Domination graphs with nontrivial components
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Domination in Digraphs
