Results 211 to 220 of about 4,520 (257)
Edge-domatic number of a graph [PDF]
Czechoslovak Mathematical Journal, 1983 openaire +2 more sources
Chromatic weak domatic partition in graphs
, 2019 In a simple graph G, a subset D of V (G) is called a chromatic weak dominating set if D is a weak dominating set and χ(< D >) = χ(G). Similar to domatic partition, chromatic weak domatic partition can be defined. The maximum cardinality of a chromatic weak domatic partition is called the chromatic weak domatic number of G.
Aristotle, Panneerselvam +3 more
openaire +2 more sources
TÜRKİYE’DE DOMATES ÜRETİMİNDE İÇ TİCARET HADLERİ
, 2019 Makbule Nisa Mencet Yelboğa +2 more
openalex +2 more sources
On $k$-domatic numbers of graphs [PDF]
Czechoslovak Mathematical Journal, 1983 openaire +1 more source