A note on the minimum number of choosability of planar graphs (Q266020): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6567797 / rank
 
Normal rank
Property / zbMATH Keywords
 
choosability
Property / zbMATH Keywords: choosability / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graph
Property / zbMATH Keywords: planar graph / rank
 
Normal rank
Property / zbMATH Keywords
 
cycle
Property / zbMATH Keywords: cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
list edge coloring
Property / zbMATH Keywords: list edge coloring / rank
 
Normal rank

Revision as of 14:28, 27 June 2023

scientific article
Language Label Description Also known as
English
A note on the minimum number of choosability of planar graphs
scientific article

    Statements

    A note on the minimum number of choosability of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2016
    0 references
    choosability
    0 references
    planar graph
    0 references
    cycle
    0 references
    list edge coloring
    0 references

    Identifiers