Neighbor sum distinguishing total colorings of planar graphs with girth at least 5

zbMATH Open1383.05108MaRDI QIDQ4604100FDOQ4604100

Authors: Jianguo Li, Shan Ge, Changqing Xu 

Publication date: 23 February 2018

Recommendations

• Neighbor sum distinguishing total chromatic number of planar graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles

zbMATH Keywords

planar graphneighbor sum distinguishing total coloringcombinatorial Nullstellensatz

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (7)

• Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs

This page was built for publication: Neighbor sum distinguishing total colorings of planar graphs with girth at least 5

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604100)