Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2007.00577.x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2122889704 / rank | |||
Normal rank | |||
Revision as of 00:46, 20 March 2024
scientific article; zbMATH DE number 5229711
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polyhedral studies for minimum‐span graph labelling with integer distance constraints |
scientific article; zbMATH DE number 5229711 |
Statements
Polyhedral studies for minimum‐span graph labelling with integer distance constraints (English)
0 references
24 January 2008
0 references
