On 2-dominating kernels in graphs
From MaRDI portal
Publication:2906866
Recommendations
- On the existence and the number of (\(2\)-\(d\))-kernels in graphs.
- Publication:4890131
- Kernels for (connected) dominating set on graphs with excluded topological minors
- On \((2-d)\)-kernels in the Cartesian product of graphs
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
- On strong \((1,1,2)\)-kernels in graphs.
- scientific article; zbMATH DE number 3929034
- On kernels in perfect graphs
- On the existence of \((k,k-1)\)-kernels in directed graphs
- A new generalization of kernels in digraphs
Cited in
(12)- On trees with unique locating kernels
- Independent double Roman domination in graphs
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem
- scientific article; zbMATH DE number 4047773 (Why is no real title available?)
- On \((2-d)\)-kernels in the Cartesian product of graphs
- On the number of \(k\)-dominating independent sets in planar graphs
- Fibonacci numbers in graphs with strong (1, 1, 2)-kernels
- On strong \((1,1,2)\)-kernels in graphs.
- Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets
- On the existence and the number of (\(2\)-\(d\))-kernels in graphs.
- On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs
This page was built for publication: On 2-dominating kernels in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906866)
