Gexin Yu

most citedOptimal open-locating-dominating sets in infinite triangular grids

8 citations · 10 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2014★ 1 cited

Planar graphs without 5-cycles and intersecting triangles are $(1, 1, 0)$ -colorable

Runrun Liu, Xiangwen Li, Gexin Yu

A $(c_{1}, c_{2}, ..., c_{k})$ -coloring of $G$ is a mapping $φ : V (G) \mapsto {1, 2, ..., k}$ such that for every $i, 1 \leq i \leq k$ , $G [V_{i}]$ has maximum degree at most $c_{i}$ , where $G [V_{i}]$ d…

math.CO2014★ 1 cited

A relaxation of the Bordeaux Conjecture

Runrun Liu, Xiangwen Li, Gexin Yu

math.CO2014★ 8 cited

Optimal open-locating-dominating sets in infinite triangular grids

Rex Kincaid, Allison Oldham, Gexin Yu

An open-locating-dominating set (OLD-set) is a subset of vertices of a graph such that every vertex in the graph has at least one neighbor in the set and no two vertices in the gra…

Planar graphs without 5-cycles and intersecting triangles are (1,1,0)-colorable

A relaxation of the Bordeaux Conjecture

Optimal open-locating-dominating sets in infinite triangular grids

Planar graphs without 5-cycles and intersecting triangles are $(1, 1, 0)$ -colorable