![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Fuliang Lu
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Jingyuan Zhang, Fuliang Lu, Xian'an Jin:
Counting spanning trees of (1, N)-periodic graphs. Discret. Appl. Math. 344: 88-101 (2024) - [j29]Yan Wang, Jiahong Deng, Fuliang Lu:
Removable edges in Halin graphs. Discret. Appl. Math. 349: 1-7 (2024) - [j28]Xiaoling He, Fuliang Lu:
The cubic vertices of solid minimal bricks. Discret. Math. 347(2): 113746 (2024) - [j27]Xiaoxia Wu, Fuliang Lu, Lianzhu Zhang:
Removable Edges in Claw-Free Bricks. Graphs Comb. 40(3): 43 (2024) - 2023
- [j26]Xiaodong Chen, Jingjing Li, Fuliang Lu:
Two Completely Independent Spanning Trees of P4-Free Graphs. Graphs Comb. 39(2): 30 (2023) - 2021
- [j25]Guantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang:
Laminar tight cuts in matching covered graphs. J. Comb. Theory B 150: 177-194 (2021) - [j24]Xing Feng, Fuliang Lu
:
On extremal nonsolid bricks. J. Graph Theory 97(2): 189-193 (2021) - 2020
- [j23]Fuliang Lu, Xing Feng, Yan Wang:
b-Invariant Edges in Essentially 4-Edge-Connected Near-Bipartite Cubic Bricks. Electron. J. Comb. 27(1): 1 (2020) - [j22]Fuliang Lu, Xiaodan Chen:
The Pfaffian property of Cayley graphs on dihedral groups. Discret. Appl. Math. 285: 642-649 (2020) - [j21]Yan Cao, Guantao Chen, Suyun Jiang
, Huiqing Liu, Fuliang Lu:
Hamiltonicity of edge-chromatic critical graphs. Discret. Math. 343(7): 111881 (2020) - [j20]Fuliang Lu, Nishad Kothari
, Xing Feng, Lianzhu Zhang:
Equivalence classes in matching covered graphs. Discret. Math. 343(8): 111945 (2020) - [j19]Qinghai Liu
, Qing Cui
, Xing Feng, Fuliang Lu
:
A characterization of nonfeasible sets in matching covered graphs. J. Graph Theory 95(4): 509-526 (2020)
2010 – 2019
- 2019
- [j18]Yan Cao, Guantao Chen, Suyun Jiang, Huiqing Liu, Fuliang Lu:
Average degrees of edge-chromatic critical graphs. Discret. Math. 342(6): 1613-1623 (2019) - [j17]Kefeng Diao, Fuliang Lu, Ping Zhao:
More results on the smallest one-realization of a given set II. Discuss. Math. Graph Theory 39(2): 473-487 (2019) - [j16]Guantao Chen
, Xing Feng, Fuliang Lu, Lianzhu Zhang:
Disjoint Odd Cycles in Cubic Solid Bricks. SIAM J. Discret. Math. 33(1): 393-397 (2019) - 2018
- [j15]Xiaodong Chen, Mingchu Li, Fuliang Lu:
Spanning 3-ended trees in quasi-claw-free graphs. Ars Comb. 138: 161-170 (2018) - [j14]Ping Zhao, Fuliang Lu, Vitaly I. Voloshin, Kefeng Diao:
On the Structure of Uniform One-Realizations of a Given Set. Graphs Comb. 34(1): 129-138 (2018) - 2017
- [j13]Fuliang Lu, Lianzhu Zhang:
A Conjecture of Norine and Thomas for Abelian Cayley Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j12]Kefeng Diao, Fuliang Lu, Vitaly I. Voloshin, Ping Zhao:
The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set. Graphs Comb. 33(4): 869-883 (2017) - 2016
- [j11]Xiaodan Chen, Fuliang Lu:
The maximal (signless Laplacian) spectral radius of connected graphs with given matching number. Ars Comb. 126: 237-247 (2016) - [j10]Ping Zhao, Kefeng Diao, Fuliang Lu:
More Result on the Smallest One-Realization of a Given Set. Graphs Comb. 32(2): 835-850 (2016) - 2015
- [j9]Xiaoxiao Duan, Kefeng Diao, Fuliang Lu, Xiao Zhu:
The smallest realization of a given vector. Ars Comb. 118: 381-389 (2015) - [j8]Fuliang Lu, Lianzhu Zhang, Yan Wang:
The Pfaffian property of circulant graphs. Discret. Appl. Math. 181: 185-192 (2015) - [j7]Ruixue Zhang, Ping Zhao, Kefeng Diao, Fuliang Lu:
The minimum chromatic spectrum of 3-uniform C-hypergraphs. J. Comb. Optim. 29(4): 796-802 (2015) - 2014
- [j6]Fuliang Lu, Lianzhu Zhang:
The Pfaffian property of Cartesian products of graphs. J. Comb. Optim. 27(3): 530-540 (2014) - [j5]Fenggen Lin, Lianzhu Zhang, Fuliang Lu:
The Cubic Vertices of Minimal Bricks. J. Graph Theory 76(1): 20-33 (2014) - [j4]Fenggen Lin, Lianzhu Zhang, Fuliang Lu:
Pfaffian orientations for a type of bipartite graph. Theor. Comput. Sci. 527: 97-101 (2014) - 2013
- [j3]Zhaolin Jiang, Fuliang Lu:
Sums and products of the Jacobsthal and Jacobsthal-Lucas numbers and their determinantal representation. Ars Comb. 110: 143-151 (2013) - 2012
- [j2]Fenggen Lin, Lianzhu Zhang, Fuliang Lu:
Perfect Matchings and Genus of Some Cartesian Products of Graphs. Discret. Math. Algorithms Appl. 4(2) (2012) - 2010
- [j1]Fuliang Lu, Lianzhu Zhang, Fenggen Lin:
Enumeration of Perfect Matchings of a Type of Quadratic Lattice on the Torus. Electron. J. Comb. 17(1) (2010)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint