The \(\{k\}\)-domatic number of a graph (Q719648): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00010-010-0062-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2139209559 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The domatic number problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Towards a theory of domination in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the \(\{k\}\)-domination number of Cartesian products of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hidden superconformal symmetry in M-theory / rank | |||
Normal rank |
Latest revision as of 11:57, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The \(\{k\}\)-domatic number of a graph |
scientific article |
Statements
The \(\{k\}\)-domatic number of a graph (English)
0 references
11 October 2011
0 references
\(\{k\}\)-dominating function
0 references
\(\{k\}\)-domination number
0 references
\(\{k\}\)-domatic number
0 references