The total \(\{k\}\)-domatic number of a graph

DOI10.1007/S10878-010-9352-4zbMath1243.90229OpenAlexW2070027148MaRDI QIDQ421274

Lutz Volkmann, Seyyed Mahmoud Sheikholeslami

Publication date: 23 May 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9352-4

zbMATH Keywords

total \(\{k\}\)-domatic numbertotal \(\{k\}\)-dominating functiontotal \(\{k\}\)-domination number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (2)

The signed edge-domatic number of nearly cubic graphs ⋮ Complexity of Total {k}-Domination and Related Problems

Cites Work

• On the total \(\{k\}\)-domination number of Cartesian products of graphs
• Extremal graphs for inequalities involving domination parameters
• Total domination in graphs

This page was built for publication: The total \(\{k\}\)-domatic number of a graph