Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree (Q3418196)
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: Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree |
scientific article; zbMATH DE number 5121313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree |
scientific article; zbMATH DE number 5121313 |
Statements
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree (English)
0 references
2 February 2007
0 references
digraph
0 references
arc-chromatic number
0 references
maximum outdegree
0 references
function theory
0 references
0.95278484
0 references
0.8665087
0 references
0.86386216
0 references
0.8609155
0 references
0.8573066
0 references
0.85459554
0 references
0.85344976
0 references
0.8517294
0 references
