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>...
Saved in:
| Main Authors: | Zhongzheng Yue, Fei Wen |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/14/7/496 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Novel method of constructing the zero-sum distinguishers
by: Le DONG, et al.
Published: (2012-11-01) -
Optimal combined distinguisher of stream cipher with multiple independent distinguishing characters
by: Hai-ying GAO, et al.
Published: (2012-07-01) -
(2, 4)-Colorability of Planar Graphs Excluding Cycles with 3, 4, and 6 Vertices
by: Pongpat Sittitrai, et al.
Published: (2025-05-01) -
Partitioning Planar Graphs Without Specific Cycles into a Forest and a Disjoint Union of Paths
by: Pongpat Sittitrai, et al.
Published: (2025-04-01) -
Communication and emotions: the art of distinguishing, processing, and reacting
by: Carolina Escudero
Published: (2023-03-01)