The strong chromatic number of a graph (Q3989737): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56390830, #quickstatements; #temporary_batch_1711196317277 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The linear arboricity of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel algorithmic version of the local lemma / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transversals of Vertex Partitions in Graphs / rank | |||
Normal rank | |||
Latest revision as of 16:13, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The strong chromatic number of a graph |
scientific article |
Statements
The strong chromatic number of a graph (English)
0 references
28 June 1992
0 references
strong chromatic number
0 references
perfect matching
0 references
strongly \(k\)-colorable
0 references
