Guanghui Wang

activity

20242026

collaborators

3 papers

math.CO2026

An Ore-type condition for $H$ -tilings in graphs

Yuping Gao, Yilin Guo, Guanghui Wang +1

A graph $G$ admits an $H$ -tiling if it contains a collection of vertex-disjoint copies of $H$ . In this paper, we confirm a conjecture proposed by KÃ¼hn, Osthus, and Treglown by sho…

math.CO2025

Vertex-distinguishing edge coloring of graphs

Yuping Gao, Songling Shan, Guanghui Wang +1

Let $k \geq 1$ be an integer and let $G$ be a nonempty simple graph. An \emph{edge- $k$ -coloring} $I ¨ $ of $G$ is an assignment of colors from ${1, \dots, k}$ to the edges of $G$ suc…

math.CO2024

Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs

Yuping Gao, Songling Shan, Guanghui Wang

Given an integer $k \geq 1$ , an edge- $k$ -coloring of a graph $G$ is an assignment of $k$ colors $1, \dots, k$ to the edges of $G$ such that no two adjacent edges receive the same color…

An Ore-type condition for H-tilings in graphs

Vertex-distinguishing edge coloring of graphs

Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs

An Ore-type condition for $H$ -tilings in graphs