Lin Tian

collaborators

2 papers

math.CO2026

A stronger upper bound on the D-chromatic index

Lin Tian, Runze Wang

For a graph $G$ , a proper edge coloring of $G$ is called a D-coloring if every diamond subgraph of $G$ is rainbow. Let $χ_{D}^{'} (G)$ be the D-chromatic index of $G$ , which is the small…

math.CO2026

List coloring $C_{3}$ -free planar graphs with a sparse matching of restricted lists

Stephen G. Hartke, Yupei Li, Joseph Pappe +3

A graph $G$ is $k$ -choosable if it has a proper coloring for every $k$ -list assignment. While every $C_{3}$ -free planar graph is $4$ -choosable, some of them are not $3$ -choosable, as…

A stronger upper bound on the D-chromatic index

List coloring C3​-free planar graphs with a sparse matching of restricted lists

List coloring $C_{3}$ -free planar graphs with a sparse matching of restricted lists