Domination in Digraphs (Q3384119): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3158599441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination number of Cartesian products of directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed total Roman domination in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination and the Caccetta-Häggkvist conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination number of Cartesian product of two directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2870959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monochromatic paths in edge-coloured digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weakly ordered systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in a digraph and in its reverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination of Cartesian product of directed cycles: Results for certain equivalence classes of lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2824021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2804821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination number of Cartesian product of directed paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination number of Cartesian product of directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5762903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the size of a maximum matching in a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the 3-kernel problem in some classes of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and fractional domination in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2804807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on lower bounds for the total domination number of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of 3- and 4-kernels in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of \((k, l)\)-kernels in digraphs with a given circumference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a conjecture of Meyniel on kernel-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in \(k\)-majority tournaments. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twin domination and twin irredundance in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The oriented cycle game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs of classical theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs, kernels, and cores of cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the Erdös-Sands-Sauer-Woodrow conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE DOMINATION NUMBER OF STRONG PRODUCT OF DIRECTED CYCLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy partition lemma for directed domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed domination in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the out-domination and in-domination numbers of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination graphs of regular tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes Noyau-Parfaits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a digraph to be kernel-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The domination and competition graphs of a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination graphs with nontrivial components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4458216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Set and Converse Dominating Set of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernels and semikernels of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference of the domination number of a digraph and of its reverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the domination number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: About quasi-kernels in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in transitive colorings of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of kernels in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient total domination in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5276525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001208 / rank
 
Normal rank

Latest revision as of 12:22, 27 July 2024

scientific article
Language Label Description Also known as
English
Domination in Digraphs
scientific article

    Statements

    Domination in Digraphs (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2021
    0 references
    paired dominating set
    0 references
    paired domination number
    0 references
    matching number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers