Gexin Yu

activity

20102023

most citedLinear colorings of subcubic graphs

15 citations · 77 across the 40 of their papers we have counts for

collaborators

Showing 2014Show all

5 papers · 1 filter

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

Extremal permutations in routing cycles

Junhua He, Louis A. Valentin, Xiaoyan Yin +1

Let $G$ be a graph on $n$ vertices, labeled $v_{1}, \dots, v_{n}$ and $π$ be a permutation on $[n] := {1, 2, \dots, n}$ . Suppose that each pebble $p_{i}$ is placed at vertex $v_{π (i)}$ and…

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…

cs.DM2014★ 2 cited

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation

Anke van Zuylen, James Bieron, Frans Schalekamp +1

We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n…

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

A relaxation of the Bordeaux Conjecture

Extremal permutations in routing cycles

Optimal open-locating-dominating sets in infinite triangular grids

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation

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