On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
From MaRDI portal
Publication:1069959
DOI10.1016/0095-8956(85)90040-1zbMath0583.05049OpenAlexW2053978154MaRDI QIDQ1069959
Publication date: 1985
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(85)90040-1
Related Items
Mixed domination and 2-independence in trees ⋮ Upper bounds for \(\alpha \)-domination parameters ⋮ On $f$-domination number of a graph ⋮ The p-domination number of complete multipartite graphs ⋮ Graphs with \(\alpha _1\) and \(\tau _1\) both large ⋮ On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence ⋮ Trees with maximum \(p\)-reinforcement number ⋮ Domination number, independent domination number and 2-independence number in trees ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ The \(p\)-bondage number of trees ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Ratios of some domination parameters in trees ⋮ A new generalization of kernels in digraphs ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ On the \(p\)-reinforcement and the complexity ⋮ Improved approximation algorithms for path vertex covers in regular graphs ⋮ The complexity of dissociation set problems in graphs ⋮ Some bounds on the \(p\)-domination number in trees ⋮ Multiple Domination ⋮ Independent \((k + 1)\)-domination in \(k\)-trees ⋮ Generalized independence and domination in graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ Middle domination and 2-independence in trees ⋮ The k-neighbor domination problem ⋮ Trees with 2-reinforcement number three
Cites Work
