Jiangxu Kong

collaborators

4 papers

math.CO2026

Rich-neighbor 5-edge-colorings of subcubic graphs whose 3-vertices induce a matching

Jiangxu Kong, Zhuming Lin, Yan Wang

Let $φ$ be a proper edge-coloring of a graph $G$ . An edge is called rich if all edges adjacent to it receive pairwise distinct colors. The coloring $φ$ is a rich-neighbor edge-colo…

math.CO2026

Linear bounds for rich-neighbor edge-colorings

Jiangxu Kong

An edge in a proper edge-coloring is rich if all edges adjacent to it receive pairwise distinct colors. A rich-neighbor edge-coloring is a proper edge-coloring in which every non-i…

math.CO2026

Degeneracy bounds, stability, and a sharp gap for $B$ -colorings

Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang

A $B$ -coloring of a graph is a proper edge-coloring in which every $4$ -cycle is rainbow, and $q_{B} (G)$ denotes the minimum number of colors in such a coloring. Let $Δ_{2} (G)$ denote t…

math.CO2026

D-coloring of planar graphs

Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang

A proper edge-coloring of a graph $G$ is a D-coloring if every subgraph isomorphic to $K_{4} - e$ is rainbow. The minimum number of colors in such a coloring is the D-chromatic index $…

Rich-neighbor 5-edge-colorings of subcubic graphs whose 3-vertices induce a matching

Linear bounds for rich-neighbor edge-colorings

Degeneracy bounds, stability, and a sharp gap for B-colorings

D-coloring of planar graphs

Degeneracy bounds, stability, and a sharp gap for $B$ -colorings