Author

Hui-Min Song

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Proper Conflict-Free Choosability for Graphs with Bounded Average Degree

For a graph $G$, a proper coloring of $G$ is called proper conflict-free if for every non-isolated vertex $u$, there is at least one color appearing exactly once in $N_G(u)$. A graph $G$ is proper conflict-free $f$-choosable if for every list assignment $L$ with $|L(v)|\ge f(v)$ for each vertex $v$, $G$ admits a proper...

Zhi-Jun Lu, Qi-Rui Ying, Hui-Min Song · 1 citation

Preprint Sep 2026

Proper conflict-free choosability of sparse graphs with girth at least seven

A proper conflict-free coloring is a proper vertex coloring in which every non-isolated vertex has a color appearing exactly once in its open neighborhood. We prove that every finite simple graph with girth at least 7 and maximum average degree less than 8/3 admits a proper conflict-free coloring from arbitrary vertex...

Xing-Qin Qi, Hui-Min Song, Zhu-Lou Cao · 0 citations