Neighbor sum distinguishing total chromatic number of K₄-minor free graph

DOI10.1007/S11464-017-0649-9zbMATH Open1371.05097OpenAlexW2615005583MaRDI QIDQ2405976FDOQ2405976

Authors: 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

Recommendations

• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum distinguishing edge colorings of \({K_4}\)-minor free graphs
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• Neighbor sum distinguishing total chromatic number of planar graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (8)

• Neighbor sum distinguishing edge colorings of \({K_4}\)-minor free graphs
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
• 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 colorings of \(K_4\)-minor free graphs
• Neighbor sum distinguishing total chromatic number of planar graphs

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

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