The total \(\{k\}\)-domatic number of wheels and complete graphs

DOI10.1007/s10878-010-9374-yzbMath1283.90043OpenAlexW2033809636MaRDI QIDQ1928533

Xin Min Hou, Jing Chen, Ning Li

Publication date: 3 January 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-010-9374-y

zbMATH Keywords

complete graphswheelstotal \(\{k\}\)-domatic numbertotal \(\{k\}\)-dominating functiontotal \(\{k\}\)-dominating family

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signed total \((k,k)\)-domatic number of a graph
• Total domination in graphs
• Towards a theory of domination in graphs

This page was built for publication: The total \(\{k\}\)-domatic number of wheels and complete graphs