3 papers
math.CO2024
Reconfiguration graphs for vertex colorings of -free graphs
Hui Lei, Yulai Ma, Zhengke Miao +2
For any positive integer , the reconfiguration graph for all -colorings of a graph , denoted by , is the graph where vertices represent the -colorings…
math.CO2020
On -flow-critical graphs
Jiaao Li, Yulai Ma, Yongtang Shi +2
A bridgeless graph is called -flow-critical if it does not admit a nowhere-zero -flow, but has for any . Tutte's -flow conjecture can be equivalently…
math.CO2019
On list 3-dynamic coloring of near-triangulations
Ruijuan Gu, Seog-Jin Kim, Yulai Ma +1
An -dynamic -coloring of a graph is a proper -coloring such that for any vertex , there are at least distinct colors in . The -dyn…