You Lu

According to our database, You Lu authored at least 27 papers between 2009 and 2023.

Collaborative distances:

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

2023

Signed planar graphs with Δ ≥ 8 are Δ-edge-colorable.

Li Zhang, You Lu, Shenggui Zhang

Discret. Math., August, 2023

2021

Flows on flow-admissible signed graphs.

Matt DeVos, Jiaao Li, You Lu, Rong Luo, Cun-Quan Zhang, Zhang Zhang

J. Comb. Theory, Ser. B, 2021

Edge DP-coloring in planar graphs.

Li Zhang, You Lu, Shenggui Zhang

Discret. Math., 2021

Flow number of signed Halin graphs.

Xiao Wang, You Lu, Shenggui Zhang

Appl. Math. Comput., 2021

2020

Flows on Signed Graphs without Long Barbells.

You Lu, Rong Luo, Michael Schubert, Eckhard Steffen, Cun-Quan Zhang

SIAM J. Discret. Math., 2020

Neighbor Sum Distinguishing Total Choosability of Cubic Graphs.

Donghan Zhang, You Lu, Shenggui Zhang

Graphs Comb., 2020

Edge coloring of signed graphs.

Li Zhang, You Lu, Rong Luo, Dong Ye, Shenggui Zhang

Discret. Appl. Math., 2020

2019

Six-flows on almost balanced signed graphs.

Xiao Wang, You Lu, Cun-Quan Zhang, Shenggui Zhang

J. Graph Theory, 2019

Shortest circuit covers of signed graphs.

You Lu, Jian Cheng, Rong Luo, Cun-Quan Zhang

J. Comb. Theory, Ser. B, 2019

2018

Signed Graphs: From Modulo Flows to Integer-Valued Flows.

Jian Cheng, You Lu, Rong Luo, Cun-Quan Zhang

SIAM J. Discret. Math., 2018

Neighbor sum distinguishing list total coloring of subcubic graphs.

You Lu, Chuandong Xu, Zhengke Miao

J. Comb. Optim., 2018

Neighbor sum distinguishing total coloring of graphs with bounded treewidth.

Miaomiao Han, You Lu, Rong Luo, Zhengke Miao

J. Comb. Optim., 2018

Multiple weak 2-linkage and its applications on integer flows of signed graphs.

You Lu, Rong Luo, Cun-Quan Zhang

Eur. J. Comb., 2018

List neighbor sum distinguishing edge coloring of subcubic graphs.

You Lu, Chong Li, Rong Luo, Zhengke Miao

Discret. Math., 2018

Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring.

You Lu, Miaomiao Han, Rong Luo

Discret. Appl. Math., 2018

2017

Adjacent vertex distinguishing total coloring of graphs with maximum degree 4.

You Lu, Jiaao Li, Rong Luo, Zhengke Miao

Discret. Math., 2017

2015

On the p-reinforcement and the complexity.

You Lu, Fu-Tao Hu, Jun-Ming Xu

J. Comb. Optim., 2015

2014

The p-domination number of complete multipartite graphs.

You Lu, Jun-Ming Xu

Discret. Math. Algorithms Appl., 2014

Trees with maximum p-reinforcement number.

You Lu, Jun-Ming Xu

Discret. Appl. Math., 2014

2013

Covering digraphs with small indegrees or outdegrees by directed cuts.

Chuandong Xu, Shenggui Zhang, You Lu

Discret. Math., 2013

2012

The total bondage number of grid graphs.

Fu-Tao Hu, You Lu, Jun-Ming Xu

Discret. Appl. Math., 2012

2011

Panconnectivity of Cartesian product graphs.

You Lu, Jun-Ming Xu

J. Supercomput., 2011

The <i>p</i>-Bondage Number of Trees.

You Lu, Jun-Ming Xu

Graphs Comb., 2011

2010

On the (2, 2)-domination number of trees.

Xinmin Hou, You Lu, Jun-Ming Xu

Discuss. Math. Graph Theory, 2010

A characterization of <i>(γ_t, γ₂)</i>-trees.

Xinmin Hou, Ning Li, You Lu, Jun-Ming Xu

Discuss. Math. Graph Theory, 2010

Bipanconnectivity of Cartesian product networks.

You Lu, Jun-Ming Xu

Australas. J Comb., 2010

2009

Bounded edge-connectivity and edge-persistence of Cartesian product of graphs.

You Lu, Jun-Ming Xu, Xinmin Hou

Discret. Appl. Math., 2009