Výsledky vyhledávání

Akademický článek

Neighbor sum distinguishing total choice number of IC-planar graphs with restrictive conditions

Autor: Fugang Chao, Donghan Zhang

Publikováno v: AIMS Mathematics, Vol 8, Iss 6, Pp 13637-13646 (2023)

A neighbor sum distinguishing (NSD) total coloring $ \phi $ of $ G $ is a proper total coloring such that $ \sum_{z\in E_{G}(u)\cup\{u\}}\phi(z)\neq\sum_{z\in E_{G}(v)\cup\{v\}}\phi(z) $ for each edge $ uv\in E(G) $. Pilśniak and Woźniak asserted t

Externí odkaz: https://doaj.org/article/0bdd187ec41845f9a4dc5f4ca8c68b80

Zobrazit plný text záznamu

Akademický článek

Neighbor sum distinguishing total choosability of triangle-free IC-planar graphs.

Autor: Fugang Chao, Chao Li, Donghan Zhang

Publikováno v: ScienceAsia; Aug2023, Vol. 49 Issue 4, p584-587, 4p

Zobrazit plný text záznamu

Akademický článek

On the Total Neighbor Sum Distinguishing Index of IC-Planar Graphs

Autor: Donghan Zhang, Chao Li, Fugang Chao

Publikováno v: Symmetry, Vol 13, Iss 10, p 1787 (2021)

A proper total k-coloring ϕ of G with ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(z) for each uv∈E(G) is called a total neighbor sum distinguishing k-coloring, where EG(u)={uv|uv∈E(G)}. Pilśniak and Woźniak conjectured that every graph with

Externí odkaz: https://doaj.org/article/b14e5f0547854db5980e49173ad9de30

Zobrazit plný text záznamu

Lower Bounds on the Number of Monochromatic Matchings in $$K_{2s+t-1}$$ K 2 s + t - 1

Autor: Fugang Chao, Weihua Lu, Han Ren, Ni Cao

Publikováno v: Graphs and Combinatorics. 33:1147-1154

Cockayne and Lorimer proved that in any 2-edge-coloring of $$K_{2s+t-1}$$ $$(s\ge t\ge 1)$$ there exists an s-matching receiving the same color (we call such matching monochromatic matching) or a t-matching having another color. In this paper, we sho

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ad29511f5ffaa5ff6cdb0163334bba80
https://doi.org/10.1007/s00373-017-1829-9

Zobrazit plný text záznamu

Odd components of co-trees and graph embeddings

Autor: Fugang Chao, Han Ren

Publikováno v: Applied Mathematics and Computation. 286:228-231

In this paper we investigate the relation between odd components of co-trees and graph embeddings. We show that any graph G must share one of the following two conditions: (a)?for each integer h such that G may be embedded on Sh, the sphere with h ha

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a60df69fe86739e485c6db4f0fedfbcf
https://doi.org/10.1016/j.amc.2016.04.027

Zobrazit plný text záznamu

Finding a shortest cycle in a subspace of the cycle space of a graph

Autor: Han Ren, Fugang Chao, Ni Cao

Publikováno v: Applied Mathematics and Computation. 268:393-398

Thomassen's 3-path-condition shows that it is relatively easy for one to find a shortest cycle in a collection of cycles beyond a subspace of the cycle space of a connected graph and the real challenge is to find a shortest cycle contained in a given

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c58691aa011a77564b0e12837235bf6d
https://doi.org/10.1016/j.amc.2015.06.053

Zobrazit plný text záznamu

Finding Shorter Cycles in a Weighted Graph

Autor: Ni Cao, Fugang Chao, Han Ren

Publikováno v: Graphs and Combinatorics. 32:65-77

In this paper we investigate the structures of short cycles in a weighted graph. By Thomassen's $$3$$3-path-condition theory (Thomassen in J Comb Theory Ser 48:155---177, 1990), it is easy to find a shortest cycle in a collection of cycles beyond a s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::18012677d906d61505dad5765348c3c0
https://doi.org/10.1007/s00373-015-1576-8

Zobrazit plný text záznamu