The vertex linear arboricity of an integer distance graph with a special distance set. (Q3428634)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The vertex linear arboricity of an integer distance graph with a special distance set. |
scientific article; zbMATH DE number 5138343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The vertex linear arboricity of an integer distance graph with a special distance set. |
scientific article; zbMATH DE number 5138343 |
Statements
29 March 2007
0 references
integer distance graph
0 references
vertex linear arboricity
0 references
path coloring
0 references
0.982029378414154
0 references
0.941378116607666
0 references
0.920144259929657
0 references
0.9060593843460084
0 references
