Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Jian-Sheng Cai / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6672915 / rank
 
Normal rank
Property / zbMATH Keywords
 
neighbor sum distinguishing total coloring
Property / zbMATH Keywords: neighbor sum distinguishing total coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
choosability
Property / zbMATH Keywords: choosability / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial Nullstellensatz
Property / zbMATH Keywords: combinatorial Nullstellensatz / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graph
Property / zbMATH Keywords: planar graph / rank
 
Normal rank

Revision as of 00:28, 1 July 2023

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
scientific article

    Statements

    Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2017
    0 references
    neighbor sum distinguishing total coloring
    0 references
    choosability
    0 references
    combinatorial Nullstellensatz
    0 references
    planar graph
    0 references

    Identifiers