default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYou Lu 0002
Person information
- affiliation: Northwestern Polytechnical University, Department of Applied Mathematics, Xi'an, China
- affiliation: University of Science and Technology of China, Department of Mathematics, Hefei, China
Other persons with the same name
- You Lu — disambiguation page
- You Lu 0001 — University of California, Los Angeles, Department of Computer Science, CA, USA
- You Lu 0003
![[0000-0002-4357-1888]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-4357-1888")
— Virginia Tech, Machine Learning Laboratory, VA, USA - You Lu 0004 — Suzhou University of Science and Technology, Institute of Electronics and Information Engineering, China
- You Lu 0005 — Fudan University, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j28]You Lu, Rong Luo, Cun-Quan Zhang:
Six-flows of signed graphs with frustration index three. Discret. Math. 348(3): 114325 (2025)- 2023
- [j27]Li Zhang, You Lu, Shenggui Zhang:
Signed planar graphs with Δ ≥ 8 are Δ-edge-colorable. Discret. Math. 346(8): 113409 (2023) - 2021
- [j26]Xiao Wang, You Lu, Shenggui Zhang:
Flow number of signed Halin graphs. Appl. Math. Comput. 393: 125751 (2021) - [j25]Li Zhang, You Lu, Shenggui Zhang:
Edge DP-coloring in planar graphs. Discret. Math. 344(5): 112314 (2021) - [j24]Matt DeVos, Jiaao Li, You Lu, Rong Luo, Cun-Quan Zhang, Zhang Zhang:
Flows on flow-admissible signed graphs. J. Comb. Theory B 149: 198-221 (2021) - 2020
- [j23]Li Zhang, You Lu, Rong Luo, Dong Ye, Shenggui Zhang:
Edge coloring of signed graphs. Discret. Appl. Math. 282: 234-242 (2020) - [j22]Donghan Zhang, You Lu, Shenggui Zhang:
Neighbor Sum Distinguishing Total Choosability of Cubic Graphs. Graphs Comb. 36(5): 1545-1562 (2020) - [j21]You Lu, Rong Luo, Michael Schubert, Eckhard Steffen, Cun-Quan Zhang:
Flows on Signed Graphs without Long Barbells. SIAM J. Discret. Math. 34(4): 2166-2182 (2020)
2010 – 2019
- 2019
- [j20]You Lu, Jian Cheng, Rong Luo, Cun-Quan Zhang:
Shortest circuit covers of signed graphs. J. Comb. Theory B 134: 164-178 (2019) - [j19]Xiao Wang, You Lu, Cun-Quan Zhang, Shenggui Zhang:
Six-flows on almost balanced signed graphs. J. Graph Theory 92(4): 394-404 (2019) - 2018
- [j18]You Lu, Miaomiao Han, Rong Luo:
Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring. Discret. Appl. Math. 237: 109-115 (2018) - [j17]You Lu, Chong Li, Rong Luo, Zhengke Miao:
List neighbor sum distinguishing edge coloring of subcubic graphs. Discret. Math. 341(2): 555-569 (2018) - [j16]You Lu, Rong Luo, Cun-Quan Zhang:
Multiple weak 2-linkage and its applications on integer flows of signed graphs. Eur. J. Comb. 69: 36-48 (2018) - [j15]You Lu, Chuandong Xu, Zhengke Miao:
Neighbor sum distinguishing list total coloring of subcubic graphs. J. Comb. Optim. 35(3): 778-793 (2018) - [j14]Miaomiao Han, You Lu, Rong Luo, Zhengke Miao:
Neighbor sum distinguishing total coloring of graphs with bounded treewidth. J. Comb. Optim. 36(1): 23-34 (2018) - [j13]Jian Cheng, You Lu, Rong Luo, Cun-Quan Zhang:
Signed Graphs: From Modulo Flows to Integer-Valued Flows. SIAM J. Discret. Math. 32(2): 956-965 (2018) - 2017
- [j12]You Lu, Jiaao Li, Rong Luo, Zhengke Miao:
Adjacent vertex distinguishing total coloring of graphs with maximum degree 4. Discret. Math. 340(2): 119-123 (2017) - 2015
- [j11]You Lu, Fu-Tao Hu, Jun-Ming Xu:
On the p-reinforcement and the complexity. J. Comb. Optim. 29(2): 389-405 (2015) - 2014
- [j10]You Lu, Jun-Ming Xu:
Trees with maximum p-reinforcement number. Discret. Appl. Math. 175: 43-54 (2014) - [j9]You Lu, Jun-Ming Xu:
The p-domination number of complete multipartite graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - 2013
- [j8]Chuandong Xu, Shenggui Zhang, You Lu:
Covering digraphs with small indegrees or outdegrees by directed cuts. Discret. Math. 313(16): 1648-1654 (2013) - 2012
- [j7]Fu-Tao Hu, You Lu, Jun-Ming Xu:
The total bondage number of grid graphs. Discret. Appl. Math. 160(16-17): 2408-2418 (2012) - 2011
- [j6]You Lu, Jun-Ming Xu:
The p-Bondage Number of Trees. Graphs Comb. 27(1): 129-141 (2011) - [j5]You Lu, Jun-Ming Xu:
Panconnectivity of Cartesian product graphs. J. Supercomput. 56(2): 182-189 (2011) - 2010
- [j4]You Lu, Jun-Ming Xu:
Bipanconnectivity of Cartesian product networks. Australas. J Comb. 46: 297-306 (2010) - [j3]Xinmin Hou, You Lu, Jun-Ming Xu:
On the (2, 2)-domination number of trees. Discuss. Math. Graph Theory 30(2): 185-199 (2010) - [j2]Xinmin Hou, Ning Li, You Lu, Jun-Ming Xu:
A characterization of (γt, γ2)-trees. Discuss. Math. Graph Theory 30(3): 425-435 (2010)
2000 – 2009
- 2009
- [j1]You Lu, Jun-Ming Xu, Xinmin Hou:
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs. Discret. Appl. Math. 157(15): 3249-3257 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 21:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
