The following pages link to On 2-dominating kernels in graphs (Q2906866):
Displaying 10 items.
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs (Q260020) (← links)
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
- Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets (Q1690033) (← links)
- Fibonacci numbers in graphs with strong (1, 1, 2)-kernels (Q2024063) (← links)
- On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs (Q2177863) (← links)
- On trees with unique locating kernels (Q2233388) (← links)
- On the existence and the number of (\(2\)-\(d\))-kernels in graphs. (Q2822834) (← links)
- (Q2953596) (← links)
- Independent double Roman domination in graphs (Q4956191) (← links)
- On the number of \(k\)-dominating independent sets in planar graphs (Q6648346) (← links)
