List colorings with distinct list sizes, the case of complete bipartite graphs (Q2851483): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1993542584 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1111.0234 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3142409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sum list coloring graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sum list coloring \(2\times n\) arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sum list coloring block graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A short list color proof of Grötzsch's theorem / rank | |||
Normal rank |
Latest revision as of 23:23, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | List colorings with distinct list sizes, the case of complete bipartite graphs |
scientific article |
Statements
List colorings with distinct list sizes, the case of complete bipartite graphs (English)
0 references
10 October 2013
0 references
graphs
0 references
list chromatic number
0 references