Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Equitable coloring and the maximum degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the independence number of random cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equitable Coloring / rank | |||
Normal rank | |||
Latest revision as of 19:06, 23 July 2024
scientific article; zbMATH DE number 7259361
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling |
scientific article; zbMATH DE number 7259361 |
Statements
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (English)
0 references
12 October 2020
0 references
batch scheduling
0 references
equitable coloring
0 references
semi-equitable coloring
0 references
cubic graph
0 references
