default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuijuan Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]Xinhong Zhang
, Xin Song, Ruijuan Li:
[k]-Roman Domination in Digraphs. Symmetry 15(3): 743 (2023)- 2022
- [j21]Khorshed Alam, Md. Mahmudul Islam, Kai Gong, Muhammad Nazeer Abbasi, Ruijuan Li, Youming Zhang, Aiying Li:
In silico genome mining of potential novel biosynthetic gene clusters for drug discovery from Burkholderia bacteria. Comput. Biol. Medicine 140: 105046 (2022) - [c4]Jing Ye, Ruijuan Li, Min Zhang, Xingjun Wu, Qian Yang:
Elderly Nursing Monitoring System Based on DSP. AIAM 2022: 192-195 - 2020
- [j20]Ruijuan Li, Juanjuan Liang, Xinhong Zhang, Yubao Guo:
Vertex-disjoint cycles in local tournaments. Discret. Math. 343(12): 112127 (2020)
2010 – 2019
- 2019
- [j19]Ruijuan Li, Bin Sheng:
The second neighbourhood for bipartite tournaments. Discuss. Math. Graph Theory 39(2): 555-565 (2019) - 2018
- [j18]Ruijuan Li, Xiaoting An, Xinhong Zhang:
The independence number of the competition graph of a bipartite tournament. Ars Comb. 136: 235-245 (2018) - [j17]Tingting Han, Ruijuan Li:
Arc-disjont Hamiltonian cycles in round decomposable locally semicomplete digraphs. Discuss. Math. Graph Theory 38(2): 477-490 (2018) - [j16]Luodan Cao, Jianjun Pan, Ruijuan Li, Jialin Li, Zhaofu Li:
Integrating Airborne LiDAR and Optical Data to Estimate Forest Aboveground Biomass in Arid and Semi-Arid Regions of China. Remote. Sens. 10(4): 532 (2018) - 2017
- [j15]Ruijuan Li, Tingting Han:
Arc-disjoint hamiltonian paths in non-round decomposable local tournaments. Discret. Math. 340(12): 2916-2924 (2017) - [i2]Gregory Z. Gutin, Ruijuan Li:
Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs. CoRR abs/1704.01389 (2017) - [i1]Bin Sheng, Ruijuan Li, Gregory Z. Gutin:
The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs. CoRR abs/1707.06503 (2017) - 2016
- [j14]Xinhong Zhang, Ruijuan Li:
The (1, 2)-step competition graph of a pure local tournament that is not round decomposable. Discret. Appl. Math. 205: 180-190 (2016) - 2015
- [j13]Ruijuan Li, Xinhong Zhang, Qiaoping Guo:
Generalizing Vertex Pancyclic and k-ordered Graphs. Graphs Comb. 31(5): 1539-1554 (2015) - 2014
- [j12]Ruijuan Li, Xinhong Zhang, Shengjia Li, Qiaoping Guo, Yubao Guo:
The H-force set of a hypertournament. Discret. Appl. Math. 169: 168-175 (2014) - 2013
- [j11]Ruijuan Li, Michael Ferrara, Xinhong Zhang, Shengjia Li:
A Fan-type degree condition for k-linked graphs. Australas. J Comb. 57: 139-144 (2013) - [j10]Xinhong Zhang, Ruijuan Li, Shengjia Li, Gaokui Xu:
A note on the existence of edges in the (1, 2)-step competition graph of a round digraph. Australas. J Comb. 57: 287-292 (2013) - 2012
- [j9]Xinhong Zhang, Ruijuan Li, Shengjia Li:
H-force sets of locally semicomplete digraphs. Discret. Appl. Math. 160(16-17): 2491-2496 (2012) - [j8]Qiaoping Guo, Shengjia Li, Ruijuan Li, Gaokui Xu:
Pancyclic out-arcs of a vertex in oriented graphs. Inf. Process. Lett. 112(20): 759-761 (2012) - [j7]Qiaoping Guo, Shengjia Li, Ruijuan Li:
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices. J. Graph Theory 71(3): 260-277 (2012) - 2011
- [c3]Lei Yan, Ruijuan Li:
Construction of Riemann-Theta Function Solutions for Benjamin-Ono Equation Based on Symbolic Computation. CSISE (3) 2011: 481-485 - [c2]Hongfang Liu, Ruijuan Li, Nana Li:
Hamilton Non-holonomic Momentum Equation of the System and Conclusions. ICICA (1) 2011: 23-29 - 2010
- [j6]Ruijuan Li, Shengjia Li, Yubao Guo:
Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian. Discret. Appl. Math. 158(4): 331-339 (2010) - [j5]Ruijuan Li:
A Fan-type result on k-ordered graphs. Inf. Process. Lett. 110(16): 651-654 (2010)
2000 – 2009
- 2008
- [j4]Ruijuan Li, Shengjia Li, Jinfeng Feng:
The number of vertices whose out-arcs are pancyclic in a 2-strong tournament. Discret. Appl. Math. 156(1): 88-92 (2008) - 2007
- [j3]Shengjia Li, Ruijuan Li, Jinfeng Feng:
The graphs satisfying conditions of Ore's type. Australas. J Comb. 37: 27-32 (2007) - [j2]Shengjia Li, Ruijuan Li, Jinfeng Feng:
An efficient condition for a graph to be Hamiltonian. Discret. Appl. Math. 155(14): 1842-1845 (2007) - [c1]Ruijuan Li, Shengjia Li, Jinfeng Feng:
The number of vertices whose out-arcs are pancyclic in 2-strong tournaments. CTW 2007: 95-97 - 2006
- [j1]Jinfeng Feng, Shengjia Li, Ruijuan Li:
An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic. Discret. Appl. Math. 154(18): 2609-2612 (2006)
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-04-25 05:47 CEST 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:
