Weichan Liu

According to our database, Weichan Liu authored at least 10 papers between 2017 and 2026.

Collaborative distances:

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

2026

Odd coloring of 2-boundary planar graphs and beyond.

Weichan Liu, Mengke Qi, Xin Zhang

Discret. Appl. Math., 2026

Equitable coloring of graphs beyond planarity.

Weichan Liu

Discret. Appl. Math., 2026

Hypergraph cooperative coloring.

Xuqing Bai, Bi Li, Weichan Liu, Xin Zhang

Discret. Appl. Math., 2026

2025

Equitable Vertex Arboricity of Graphs with Low Maximum Degree.

Ping Chen, Weichan Liu, Xin Zhang

Graphs Comb., August, 2025

Independent transversal blow-up of graphs.

Tianjiao Dai, Weichan Liu, Xin Zhang

CoRR, February, 2025

2024

Weak-Dynamic Coloring of Graphs Beyond-Planarity.

Weichan Liu, Guiying Yan

Graphs Comb., February, 2024

Equitable coloring of sparse graphs.

Weichan Liu, Xin Zhang

CoRR, 2024

2023

Hypergraph incidence coloring.

Weichan Liu, Guiying Yan

Discret. Math., May, 2023

2020

Total Coloring of Outer-1-planar Graphs: The Cold Case.

Weichan Liu, Xin Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2017

A note on the vertex arboricity of signed graphs.

Weichan Liu, Chen Gong, Lifang Wu, Xin Zhang

CoRR, 2017