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>...

书目详细资料
发表在:	Axioms
Main Authors:	Zhongzheng Yue, Fei Wen
格式:	文件
语言:	英语
出版:	MDPI AG 2025-06-01
主题:	neighbor full sum distinguishing total coloring planar graph discharging method
在线阅读:	https://www.mdpi.com/2075-1680/14/7/496

相似书籍

Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
由: Zhao Xue, et al.
出版: (2020-02-01)

Neighbor sum distinguishing total choice number of IC-planar graphs with restrictive conditions
由: Fugang Chao, et al.
出版: (2023-04-01)

Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ<sub>2,1,2</sub>
由: Donghan Zhang
出版: (2021-03-01)

Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
由: Song Wen-Yao, et al.
出版: (2020-02-01)

Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
由: Dong Aijun, et al.
出版: (2021-11-01)

A Note on Neighbor Expanded Sum Distinguishing Index
由: Flandrin Evelyne, et al.
出版: (2017-02-01)

Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree
由: Jingjing Huo, et al.
出版: (2023-12-01)

An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index
由: Vučković Bojan
出版: (2020-02-01)

On a Total Version of 1-2-3 Conjecture
由: Baudon Olivier, et al.
出版: (2020-11-01)

Partitioning planar graphs with girth at least 9 into an edgeless graph and a graph with bounded size components
由: Chunyu Tian, et al.
出版: (2021-08-01)

Equitable Coloring of IC-Planar Graphs with Girth <i>g</i> ≥ 7
由: Danjun Huang, et al.
出版: (2023-08-01)

Injective coloring of planar graphs with girth 5
由: Yuehua Bu, et al.
出版: (2023-05-01)

Distinguishing colorings of graphs and their subgraphs
由: Baolin Ma, et al.
出版: (2023-09-01)

On the graphs with distinguishing number equal list distinguishing number
由: Saeid Alikhani, et al.
出版: (2023-05-01)

Distinguishing Number and Distinguishing Index of the Join of Two Graphs
由: Saeid Alikhani, et al.
出版: (2019-12-01)

Planar Graphs with the Distance of 6<sup>-</sup>-Cycles at Least 2 from Each Other Are DP-3-Colorable
由: Yueying Zhao, et al.
出版: (2020-12-01)

The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
由: Immel Poppy, et al.
出版: (2017-02-01)

Light Graphs In Planar Graphs Of Large Girth
由: Hudák Peter, et al.
出版: (2016-02-01)

Novel method of constructing the zero-sum distinguishers
由: Le DONG, et al.
出版: (2012-11-01)

Novel method of constructing the zero-sum distinguishers
由: Le DONG, et al.
出版: (2012-11-01)

‎Distinguishing index of Kronecker product of two graphs
由: ‎Saeid Alikhani, et al.
出版: (2021-04-01)

Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs
由: Zengtai Gong, et al.
出版: (2023-05-01)

Strong Chromatic Index Of Planar Graphs With Large Girth
由: Jennhwa Chang Gerard, et al.
出版: (2014-11-01)

Optimal combined distinguisher of stream cipher with multiple independent distinguishing characters
由: Hai-ying GAO, et al.
出版: (2012-07-01)

Optimal combined distinguisher of stream cipher with multiple independent distinguishing characters
由: Hai-ying GAO, et al.
出版: (2012-07-01)

On the Total Set Chromatic Number of Graphs
由: Mark Anthony C. Tolentino, et al.
出版: (2022-07-01)

The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
由: Alikhani Saeid, et al.
出版: (2018-08-01)

On multiset colorings of generalized corona graphs
由: Yun Feng, et al.
出版: (2016-12-01)

Additive List Coloring of Planar Graphs with Given Girth
由: Brandt Axel, et al.
出版: (2020-08-01)

Fault Tolerant Detectors for Distinguishing Sets in Graphs
由: Seo Suk J., et al.
出版: (2015-11-01)

Sum List Edge Colorings of Graphs
由: Kemnitz Arnfried, et al.
出版: (2016-08-01)

The Relationship Between the Distinguishing Number and the Distinguishing Index with the Detection Number
由: Saeid Alikhani, et al.
出版: (2020-05-01)

On the list injective coloring of planar graphs without a $ {4^ - } $-cycle intersecting with a $ {5^ - } $-cycle
由: Yuehua Bu, et al.
出版: (2025-01-01)

On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords
由: Sun Lin, et al.
出版: (2019-05-01)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
由: Hoang La, et al.
出版: (2025-03-01)

Generalized Sum List Colorings of Graphs
由: Kemnitz Arnfried, et al.
出版: (2019-08-01)

Partitioning Planar Graphs Without Specific Cycles into a Forest and a Disjoint Union of Paths
由: Pongpat Sittitrai, et al.
出版: (2025-04-01)

Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
由: Chen Xiang’en, et al.
出版: (2013-05-01)

The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
由: Sun Lin, et al.
出版: (2020-11-01)

Every Planar Graph with the Distance of 5<sup>−</sup>-Cycles at Least 3 from Each Other Is DP-3-Colorable
由: Yueying Zhao, et al.
出版: (2020-11-01)