Neighbor sum distinguishing total chromatic number of 2-degenerate graphs

DOI10.1016/J.DAM.2018.05.046zbMath1401.05128OpenAlexW2809234443WikidataQ129636050 ScholiaQ129636050MaRDI QIDQ1627882

Changqing Xu, Jianguo Li, Shan Ge

Publication date: 3 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.046

zbMATH Keywords

combinatorial Nullstellensatz2-degenerate graphneighbor sum distinguishing total chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing total choosability of cubic graphs ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Combinatorial Nullstellensatz
• On the Neighbor Sum Distinguishing Index of Planar Graphs

This page was built for publication: Neighbor sum distinguishing total chromatic number of 2-degenerate graphs