Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.

zbMATH Open1413.05353MaRDI QIDQ2828964FDOQ2828964

Authors: Jing Jing Yao, Hai Rong Kong 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
• Neighbor sum distinguishing total coloring of a kind of sparse graph.

zbMATH Keywords

neighbor sum distinguishing total coloringcombinatorial Nullstellensatzneighbor sum distinguishing total choosability

Mathematics Subject Classification ID

Vertex degrees (05C07) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (10)

• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
• Neighbor sum distinguishing total coloring of a kind of sparse graph.
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
• Neighbor product distinguishing total coloring of planar graphs without 5-cycles
• Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
• Neighbor sum distinguishing total choosability of IC-planar graphs

This page was built for publication: Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.

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