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

DOI10.1007/S11464-017-0649-9MaRDI QIDQ2405976zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(K_4\)-minor free graphcombinatorial Nullstellensatzneighbor sum distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

Cites work

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

Cited in

(9)

• 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
• Neighbor sum distinguishing total 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 edge colorings of \({K_4}\)-minor free graphs
• Total-neighbor-distinguishing coloring by sums of fractals of generalized Sierpiński 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)