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

MaRDI QIDQ4604358zbMATH OpenFDO

Authors Shan Ge, Jianguo Li, Changqing Xu

Publication date 23 February 2018

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)

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

Cited in

(5)

• 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\)
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• scientific article; zbMATH DE number 7478554 (Why is no real title available?)

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)