On the acyclic choosability of graphs (Q5469027): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.20134 / rank | |||
| Property / cites work | |||
| Property / cites work: Minimum partition of a matroid into independent subsets / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.20134 / rank | |||
Normal rank | |||
Latest revision as of 17:03, 30 December 2024
scientific article; zbMATH DE number 5023702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the acyclic choosability of graphs |
scientific article; zbMATH DE number 5023702 |
Statements
On the acyclic choosability of graphs (English)
0 references
16 May 2006
0 references
list coloring
0 references
acyclic coloring
0 references
maximum average degree
0 references
