Neighbor sum distinguishing total chromatic number of planar graphs without 4-cycles

zbMATH Open1398.05087MaRDI QIDQ4604358FDOQ4604358

Authors: Shan Ge, Jianguo Li, Changqing Xu 

Publication date: 23 February 2018

Recommendations

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

zbMATH Keywords

planar graphneighbor sum distinguishing total coloringneighbor sum distinguishing total chromatic number

Mathematics Subject Classification ID

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

Cited In (5)

• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Title not available (Why is that?)
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)

This page was built for publication: Neighbor sum distinguishing total chromatic number of planar graphs without 4-cycles

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