On 2-dominating kernels in graphs
From MaRDI portal
Publication:2906866
zbMATH Open1256.05180MaRDI QIDQ2906866FDOQ2906866
Publication date: 5 September 2012
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p273.pdf
Cited In (10)
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem
- On trees with unique locating kernels
- Fibonacci numbers in graphs with strong (1, 1, 2)-kernels
- 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
- On the number of \(k\)-dominating independent sets in planar graphs
- Generalizing ErdΕs, Moon and Moser's result -- the number of \(k\)-dominating independent sets
- Title not available (Why is that?)
- Independent double Roman domination in graphs
Recommendations
- On the existence and the number of (\(2\)-\(d\))-kernels in graphs. π π
- Title not available (Why is that?) π π
- Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors π π
- Title not available (Why is that?) π π
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On kernels in perfect graphs π π
- Title not available (Why is that?) π π
- A new generalization of kernels in 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)
