Circular degree choosability (Q1010827)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5541005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Circular degree choosability |
scientific article; zbMATH DE number 5541005 |
Statements
Circular degree choosability (English)
0 references
7 April 2009
0 references
Summary: We extend a characterization of degree-choosable graphs due to \textit{O.V. Borodin} [''Criterion of chromaticity of a degree prescription'' (in Russian), Abstracts of IV All-Union Conference on Theoretical Cybernetics (Novosibirsk), 127--128 (1977)], and \textit{P. Erdős}, \textit{A.L. Rubin}, and \textit{H. Taylor} [Combinatorics, graph theory and computing, Proc. West Coast Conf., Arcata/Calif. 1979, Congress. Numer. XXIV, 125--157 (1980; Zbl 0469.05032)], to circular list-colorings.
0 references
degree choosable graphs
0 references
circular list colorings
0 references
0.815231204032898
0 references
0.798210084438324
0 references
0.7885497808456421
0 references
0.7839432954788208
0 references
0.7838600873947144
0 references
