\(L(0,1)\)-labelling of permutation graphs (Q894561): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10852-015-9280-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10852-015-9280-5 / rank | |||
Normal rank | |||
Latest revision as of 07:31, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(L(0,1)\)-labelling of permutation graphs |
scientific article |
Statements
\(L(0,1)\)-labelling of permutation graphs (English)
0 references
1 December 2015
0 references
frequency assignment problem
0 references
\(L(0,1)\)-labelling
0 references
permutation graph
0 references
0 references
0 references
