5 citations · 11 across the 10 of their papers we have counts for
11 papers
Signed list edge coloring in graphs of bounded treewidth
Li Zhang, You Lu, Zhengke Miao +1
Vizing conjectured that the list edge chromatic number of any graph with maximum degree is at most . This conjecture has been confirmed for several important classes of g…
Flows on signed graphs without long barbells
You Lu, Rong Luo, Michael Schubert +2
Many basic properties in Tutte's flow theory for unsigned graphs do not have their counterparts for signed graphs. However, signed graphs without long barbells in many ways behave…
Flows on flow-admissible signed graphs
Matt DeVos, Jiaao Li, You Lu +3
In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero -flow. Bouchet himself proved that such signed graphs admit nowhere-zero $21…
Signed graphs: from modulo flows to integer-valued flows
Jian Cheng, You Lu, Rong Luo +1
Converting modulo flows into integer-valued flows is one of the most critical steps in the study of integer flows. Tutte and Jaeger's pioneering work shows the equivalence of modul…
On the second smallest and the largest normalized Laplacian eigenvalues of a graph
Xiaoguo Tian, Ligong Wang, Yong Lu
Let be a simple connected graph with order . Let be the normalized Laplacian matrix of . Let be the -th smallest normalized Laplacian eigen…
Shortest circuit covers of signed graphs
Jian Cheng, You Lu, Rong Luo +1
A shortest circuit cover of a bridgeless graph is a family of circuits that covers every edge of and is of minimum total length. The total length of a shortest c…