default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuixia Wang
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Ruixia Wang
, Linxin Wu:
Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions. Discuss. Math. Graph Theory 44(1): 245 (2024)- [i1]Z. T. Wang, Qiuhao Chen, Yuxuan Du, Z. H. Yang, Xiaoxia Cai, Kaixuan Huang, Jingning Zhang, Kai Xu, Jun Du, Yinan Li, Yuling Jiao, Xingyao Wu, Wu Liu, Xiliang Lu, Huikai Xu, Yirong Jin, Ruixia Wang, Haifeng Yu, S. P. Zhao:
Quantum Compiling with Reinforcement Learning on a Superconducting Processor. CoRR abs/2406.12195 (2024) - 2023
- [j31]Ruixia Wang, Zhiyi Zhou:
Degree sum condition on distance 2 vertices for hamiltonian cycles in balanced bipartite graphs. Discret. Math. 346(7): 113446 (2023) - [j30]Qiaoping Guo, Ruixia Wang, Wei Meng, Chunfang Li:
A Sufficient Condition for Vertex Bipancyclicity in Balanced Bipartite Graphs. Graphs Comb. 39(4): 69 (2023) - [j29]Tao Lin, Biao Chen, Ruixia Wang, Yabo Zhang, Yu Shi, Nan Jiang:
Multi-state feature optimization of sign glosses for continuous sign language recognition. J. Intell. Fuzzy Syst. 45(4): 6645-6654 (2023) - [j28]Yu Shi, Tao Lin, Biao Chen, Ruixia Wang, Yabo Zhang:
Structured deep learning based object-specific distance estimation from a monocular image. Int. J. Mach. Learn. Cybern. 14(12): 4151-4161 (2023) - 2022
- [j27]Ruixia Wang:
A Note on Dominating Pair Degree Condition for Hamiltonian Cycles in Balanced Bipartite Digraphs. Graphs Comb. 38(1): 13 (2022) - 2021
- [j26]Ruixia Wang:
Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter. Discuss. Math. Graph Theory 41(2): 685-690 (2021) - [j25]Ruixia Wang, Linxin Wu, Wei Meng:
Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j24]Ruixia Wang:
Extremal digraphs on Woodall-type condition for Hamiltonian cycles in balanced bipartite digraphs. J. Graph Theory 97(2): 194-207 (2021) - 2020
- [j23]Ruixia Wang, Linxin Wu:
A dominating pair condition for a balanced bipartite digraph to be hamiltonian. Australas. J Comb. 77: 136-143 (2020) - [j22]Ruixia Wang, Jingfang Chang, Linxin Wu:
A dominated pair condition for a digraph to be hamiltonian. Discret. Math. 343(5): 111794 (2020)
2010 – 2019
- 2019
- [j21]Ruixia Wang:
Critical Kernel Imperfect Problem in Generalizations of Bipartite Tournaments. Graphs Comb. 35(3): 669-675 (2019) - 2017
- [j20]Ruixia Wang, Jing Guo:
A note on cycles of maximum length in bipartite digraphs. Australas. J Comb. 67: 1-10 (2017) - [j19]Wei Meng, Ruixia Wang:
The signed cycle domatic number of a graph. Ars Comb. 130: 131-141 (2017) - [j18]Ruixia Wang:
A sufficient condition for a balanced bipartite digraph to be hamiltonian. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - 2016
- [j17]Ruixia Wang, Shiying Wang:
Kings in strong tournaments. Ars Comb. 126: 351-358 (2016) - [j16]Ruixia Wang, Hui Zhang:
Hamiltonian paths in k-quasi-transitive digraphs. Discret. Math. 339(8): 2094-2099 (2016) - 2015
- [j15]Wei Meng, Ruixia Wang:
Sharp lower bounds on signed domination numbers of digraphs. Ars Comb. 121: 281-289 (2015) - [j14]Ruixia Wang:
(k+1)-kernels and the number of k-kings in k-quasi-transitive digraphs. Discret. Math. 338(1): 114-121 (2015) - [j13]Ruixia Wang:
(k-1)-kernels in strong k-transitive digraphs. Discuss. Math. Graph Theory 35(2): 229-235 (2015) - [j12]Ruixia Wang, Wei Meng:
k-Kings in k-Quasitransitive Digraphs. J. Graph Theory 79(1): 55-62 (2015) - 2014
- [j11]Ruixia Wang:
Cycles in 3-anti-circulant digraphs. Australas. J Comb. 60: 158-168 (2014) - [j10]Ruixia Wang:
A conjecture on 3-anti-quasi-transitive digraphs. Discret. Math. 322: 48-52 (2014) - 2013
- [j9]Ruixia Wang, Shiying Wang:
A sufficient condition for graphs to be λk-optimal. Discret. Appl. Math. 161(18): 3048-3053 (2013) - [j8]Shiying Wang, Ruixia Wang:
Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs. Discuss. Math. Graph Theory 33(2): 429-435 (2013) - [j7]Shiying Wang, Jing Li, Shangwei Lin, Ruixia Wang:
Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes. Inf. Comput. 230: 55-66 (2013) - 2012
- [j6]Ruixia Wang:
A conjecture on k-transitive digraphs. Discret. Math. 312(8): 1458-1460 (2012) - 2011
- [j5]Shiying Wang, Ruixia Wang:
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs. Discret. Math. 311(4): 282-288 (2011) - [j4]Shiying Wang, Jing Li, Ruixia Wang:
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube. Inf. Sci. 181(14): 3054-3065 (2011) - 2010
- [j3]Shiying Wang, Ruixia Wang, Shangwei Lin, Jing Li:
Matching preclusion for k-ary n-cubes. Discret. Appl. Math. 158(18): 2066-2070 (2010) - [j2]Ruixia Wang, Aimin Yang, Shiying Wang:
Kings in locally semicomplete digraphs. J. Graph Theory 63(4): 279-287 (2010)
2000 – 2009
- 2009
- [j1]Shiying Wang, Ruixia Wang:
The structure of strong arc-locally in-semicomplete digraphs. Discret. Math. 309(23-24): 6555-6562 (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-07-25 20:23 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:
