Neighbor Full Sum Distinguishing Total Coloring of Planar Graphs with Girth at Least 5

A neighbor full sum distinguishing total coloring of a graph <i>G</i> is a proper <i>k</i>-total coloring <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ϕ</mi></semantics></math></inline-formula> such that no two adjacent vertices <i>u</i> and <i>v</...

全面介紹

書目詳細資料

Principais autores:	Zhongzheng Yue, Fei Wen
格式:	Artigo
語言:	Inglês
出版:	MDPI AG 2025-06-01
叢編:	Axioms
主題:	neighbor full sum distinguishing total coloring planar graph discharging method
在線閱讀:	https://www.mdpi.com/2075-1680/14/7/496
標簽:	添加標簽 沒有標簽, 成為第一個標記此記錄!