Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph

DOI10.1007/s11464-017-0649-9zbMath1371.05097OpenAlexW2615005583MaRDI QIDQ2405976

Hongjie Song, Changqing Xu

Publication date: 26 September 2017

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-017-0649-9

zbMATH Keywords

neighbor sum distinguishing total coloringcombinatorial Nullstellensatz\(K_4\)-minor free graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Neighbor sum distinguishing total chromatic number of 2-degenerate graphs ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs

Cites Work

• Unnamed Item
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• Neighbor sum distinguishing total choosability of planar graphs
• 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
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Combinatorial Nullstellensatz
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz

This page was built for publication: Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph