Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree (Q3418196): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 11:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree |
scientific article |
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
