On the acyclic choosability of graphs (Q5469027): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20134 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2307903789 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum partition of a matroid into independent subsets / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:12, 24 June 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
