Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree (Q3418196): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:15, 4 February 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
