Yu-Chang Liang

According to our database, Yu-Chang Liang authored at least 9 papers between 2013 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Total weight choosability for Halin graphs.

Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu

Electron. J. Graph Theory Appl., 2021

2018

Graphs with maximum average degree less than 114 are (1, 3)-choosable.

Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu

Discret. Math., 2018

Total list weighting of graphs with bounded maximum average degree.

Yu-Chang Liang, Yunfang Tang, Tsai-Lien Wong, Xuding Zhu

Discret. Math., 2018

2017

On xD-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks.

Sen-Peng Eu, Tung-Shan Fu, Yu-Chang Liang, Tsai-Lien Wong

Electron. J. Comb., 2017

2016

Antimagic Labeling of Regular Graphs.

Fei-Huang Chang, Yu-Chang Liang, Zhishi Pan, Xuding Zhu

J. Graph Theory, 2016

2015

Regular Graphs of Odd Degree Are Antimagic.

Daniel W. Cranston, Yu-Chang Liang, Xuding Zhu

J. Graph Theory, 2015

2014

Antimagic Labeling of Cubic Graphs.

Yu-Chang Liang, Xuding Zhu

J. Graph Theory, 2014

Anti-magic labeling of trees.

Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu

Discret. Math., 2014

2013

Anti-magic labelling of Cartesian product of graphs.

Yu-Chang Liang, Xuding Zhu

Theor. Comput. Sci., 2013