Decompositions of 6-Regular Bipartite Graphs into Paths of Length Six von Chu, Yanan, Fan, Genghua, Zhou, Chuixiang

Volltext

Ore’s condition for completely independent spanning trees von Fan, Genghua, Hong, Yanmei, Liu, Qinghai

Volltext

Nonsmooth Optimization Method for VLSI Global Placement von Wenxing Zhu, Jianli Chen, Zheng Peng, Genghua Fan

Volltext

Circuit k-covers of signed graphs von Chen, Jing, Fan, Genghua

Volltext

Integer 4-Flows and Cycle Covers von Fan, Genghua

Volltext

Degree sum and nowhere-zero 3-flows von Fan, Genghua, Zhou, Chuixiang

Volltext

The Erdős–Sós conjecture for spiders of large size von Fan, Genghua

Volltext

Bounds for pairs in judicious partitioning of graphs von Fan, Genghua, Hou, Jianfeng

Volltext

Short signed circuit covers of signed graphs von Chen, Jing, Fan, Genghua

Volltext

The Erdös–Sós conjecture for spiders von Fan, Genghua, Sun, Lingli

Volltext

Path decompositions of triangle-free graphs von Chu, Yanan, Fan, Genghua, Zhou, Chuixiang

Volltext

Nowhere-zero 3-flows in triangularly connected graphs von Fan, Genghua, Lai, Hongjian, Xu, Rui, Zhang, Cun-Quan, Zhou, Chuixiang

Volltext

On Gallai’s conjecture for graphs with maximum degree 6 von Chu, Yanan, Fan, Genghua, Liu, Qinghai

Volltext

The ErdAsaSA3s conjecture for spiders of large size von Fan, Genghua

Volltext

Fulkerson-covers of hypohamiltonian graphs von Chen, Fuyuan, Fan, Genghua

Volltext

Large even factors of graphs von Chen, Jing, Fan, Genghua

Volltext

Maximum even factors of graphs von Chen, Fuyuan, Fan, Genghua

Volltext

Circuit Covers of Signed Eulerian Graphs von Bao, Bo, Chen, Rong, Fan, Genghua

Volltext

A bound for judicious k-partitions of graphs von Fan, Genghua, Hou, Jianfeng, Zeng, Qinghou

Volltext

Bisections of Graphs Without Short Cycles von FAN, GENGHUA, HOU, JIANFENG, YU, XINGXING

Volltext