Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree

DOI10.4208/jms.v56n2.23.06OpenAlexW4382727933MaRDI QIDQ6121343

Dan Bao, Danjun Huang

Publication date: 26 February 2024

Published in: Journal of Mathematical Study (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/jms.v56n2.23.06

zbMATH Keywords

neighbor sum distinguishing total coloringcombinatorial Nullstellensatzmaximum average degree

Mathematics Subject Classification ID

Higher-dimensional and -codimensional surfaces in Euclidean and related (n)-spaces (53A07) Global submanifolds (53C40) Rigidity results (53C24)

Cites Work

• Unnamed Item
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
• On the total-neighbor-distinguishing index by sums
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree

This page was built for publication: Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree