Fuhong Ma

activity

20172022

most citedDefective DP-colorings of sparse multigraphs

2 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2022

The minimum number of clique-saturating edges

Jialin He, Fuhong Ma, Jie Ma +1

Let $G$ be a $K_{p}$ -free graph. We say $e$ is a $K_{p}$ -saturating edge of $G$ if $e \in / E (G)$ and $G + e$ contains a copy of $K_{p}$ . Denote by $f_{p} (n, e)$ the minimum number of $K_{p}$ -…

math.CO2020

Defective DP-colorings of sparse simple graphs

Yifan Jing, Alexandr Kostochka, Fuhong Ma +1

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study $(i, j)$ -defective DP-colori…

math.CO2019★ 2 cited

Defective DP-colorings of sparse multigraphs

Yifan Jing, Alexandr Kostochka, Fuhong Ma +2

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study $(i, j)$ -defective DP-colori…

math.CO2017★ 1 cited

The confirmation of a conjecture on disjoint cycles in a graph

Fuhong Ma, Jin Yan

In this paper, we prove the following conjecture proposed by Gould, Hirohata and Keller [Discrete Math. submitted]: Let $G$ be a graph of sufficiently large order. If $σ_t(G) \geq…