3 papers
math.CO2026
Strong chromatic index of bipartite graphs
Yanli Hao, Tianchi Yang, Xingxing Yu
An edge-coloring of a graph is called a strong edge-coloring if all its color classes are induced matchings in ; the minimum number of colors required for such a coloring, d…
math.CO2025
On the 3-colorability of triangle-free and fork-free graphs
Joshua Schroeder, Zhiyu Wang, Xingxing Yu
A graph is said to satisfy the Vizing bound if , where and denote the chromatic number and clique number of , respectively. It was conject…
math.CO2024
On Tutte cycles containing three prescribed edges
Michael C. Wigal, Xingxing Yu
A cycle in a graph is called a Tutte cycle if, after deleting from , each component has at most three neighbors on . Tutte cycles play an important role in the st…