Boyan Xu

activity

20172026

most citedThe Graph Laplacian and Morse Inequalities

5 citations · 6 across the 4 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Strongly separating graph edges with $10 n$ paths

Xiao-Chuan Liu, Boyan Xu, Xu Yang

A family of paths strongly separates the edges of a graph if every two distinct edges are separated in both directions by paths in the family. Bonamy, Botler, Dross, Naia, and Skok…

math.CO2026

Linear Lower Bounds for the Modular Chromatic Index

Xiao-Chuan Liu, Boyan Xu, Xu Yang

Let $k \geq 2$ be an integer. A $1 mod k$ edge-coloring of a graph $G$ is an edge-coloring in which every nonzero degree in each color class is congruent to $1$ modulo $k$ . Let $χ'_…

Strongly separating graph edges with 10n paths

Linear Lower Bounds for the Modular Chromatic Index

Strongly separating graph edges with $10 n$ paths