Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree (Q3418196): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20189 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4247166723 / rank | |||
Normal rank | |||
Latest revision as of 18:28, 19 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
