On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees (Q495674)
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: On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees |
scientific article; zbMATH DE number 6482176
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees |
scientific article; zbMATH DE number 6482176 |
Statements
On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees (English)
0 references
15 September 2015
0 references
combinatorial problems
0 references
digraph
0 references
arc-chromatic number
0 references
outdegree
0 references
indegree
0 references
0 references
0 references
0.9457253813743592
0 references
0.785814642906189
0 references
0.776689887046814
0 references
0.7764456272125244
0 references
0.7753217220306396
0 references
