List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs (Q2811205): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2623096099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum list coloring graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum choice numbers of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum choice number of \(P_3 \square P_n\) / 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: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank

Latest revision as of 03:56, 12 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
    0 references
    0 references
    0 references
    10 June 2016
    0 references
    0 references
    list chromatic number
    0 references
    0 references