\(L(0,1)\)-labelling of permutation graphs (Q894561): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:20, 30 January 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