Cubic Graphs with Total Domatic Number at Least Two

Saieed Akbari, et al. "Cubic Graphs with Total Domatic Number at Least Two." Discussiones Mathematicae Graph Theory 38.1 (2018): 75-82. <http://eudml.org/doc/288591>.

@article{SaieedAkbari2018,
abstract = {Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of G. In this paper we provide a criterion under which a cubic graph has total domatic number at least two.},
author = {Saieed Akbari, Mohammad Motiei, Sahand Mozaffari, Sina Yazdanbod},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {total domination; total domatic number; coupon coloring},
language = {eng},
number = {1},
pages = {75-82},
title = {Cubic Graphs with Total Domatic Number at Least Two},
url = {http://eudml.org/doc/288591},
volume = {38},
year = {2018},
}

TY - JOUR
AU - Saieed Akbari
AU - Mohammad Motiei
AU - Sahand Mozaffari
AU - Sina Yazdanbod
TI - Cubic Graphs with Total Domatic Number at Least Two
JO - Discussiones Mathematicae Graph Theory
PY - 2018
VL - 38
IS - 1
SP - 75
EP - 82
AB - Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of G. In this paper we provide a criterion under which a cubic graph has total domatic number at least two.
LA - eng
KW - total domination; total domatic number; coupon coloring
UR - http://eudml.org/doc/288591
ER -