default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBaoyindureng Wu
Baoyingdureng Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j105]Fangxia Wang, Baoyindureng Wu:
The k-Sombor Index of Trees. Asia Pac. J. Oper. Res. 41(1): 2350002:1-2350002:34 (2024)- [j104]Bo Zhang, Baoyindureng Wu
:
Graphs G where G-N[v] is a regular graph for each vertex v. Comput. Appl. Math. 43(5): 294 (2024) - [j103]Yanfang Liang, Baoyindureng Wu:
On some conjectures on biclique graphs. Discret. Appl. Math. 343: 184-190 (2024) - [j102]Gang Zhang, Baoyindureng Wu:
k-isolation in graphs. Discret. Appl. Math. 357: 99-111 (2024) - [j101]Wei Yang, Baoyindureng Wu:
Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two. Discret. Math. 347(10): 114122 (2024) - [j100]Gang Zhang, Baoyindureng Wu:
On the cycle isolation number of triangle-free graphs. Discret. Math. 347(12): 114190 (2024) - [j99]Wei Yang, Baoyindureng Wu:
Outer connected domination in maximal outerplanar graphs and beyond. Discuss. Math. Graph Theory 44(2): 575 (2024) - [j98]Gang Zhang, Baoyindureng Wu:
Cycle Isolation of Graphs with Small Girth. Graphs Comb. 40(2): 38 (2024) - [j97]Bo Zhang, Baoyindureng Wu:
Graphs G Where G-N[v] is a Tree for Each Vertex v. Graphs Comb. 40(4): 85 (2024) - [j96]Shuting Cheng, Baoyindureng Wu:
The first general Zagreb index of graphs and their line graphs. J. Appl. Math. Comput. 70(3): 1937-1951 (2024) - 2023
- [j95]Tao Wang, Baoyindureng Wu:
Induced subgraphs of a tree with constraint degree. Appl. Math. Comput. 440: 127657 (2023) - [j94]Tongtong Xu, Baoyindureng Wu:
Weak saturation number of a complete bipartite graph. Appl. Math. Comput. 455: 128097 (2023) - [j93]Jiawei Meng, Baoyindureng Wu, Hongliang Ma:
On Several Parameters of Super Line Graph L2(G). Axioms 12(3): 276 (2023) - [j92]Wei Yang, Baoyindureng Wu:
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs. Discret. Appl. Math. 324: 99-102 (2023) - [j91]Tao Wang, Baoyindureng Wu, Taishan Wang:
Harmonic index of a line graph. Discret. Appl. Math. 325: 284-296 (2023) - [j90]Wei Yang, Baoyindureng Wu:
On packing S-colorings of subcubic graphs. Discret. Appl. Math. 334: 1-14 (2023) - [j89]Zhenzhen Li, Baoyindureng Wu:
Conflict-Free Connection Number of Graphs with Four Bridges. Graphs Comb. 39(3): 50 (2023) - [j88]Wei Yang, Baoyindureng Wu:
Dominating Sets Inducing Large Component in Graphs with Minimum Degree Two. Graphs Comb. 39(5): 99 (2023) - 2022
- [j87]Xiaohong Chen, Baoyindureng Wu:
Domination number and feedback vertex number of complements of line graphs. AKCE Int. J. Graphs Comb. 19(3): 171-176 (2022) - [j86]Wei Yang, Baoyindureng Wu:
On S-packing edge-colorings of graphs with small edge weight. Appl. Math. Comput. 418: 126840 (2022) - [j85]Zhenzhen Li, Baoyindureng Wu:
Proper-walk connection of hamiltonian digraphs. Appl. Math. Comput. 427: 127169 (2022) - [j84]Jiangfu Zhang, Baoyindureng Wu:
Randić Index of a Line Graph. Axioms 11(5): 210 (2022) - [j83]Wei Yang, Baoyindureng Wu:
Disproofs of three conjectures on the power domination of graphs. Discret. Appl. Math. 307: 62-64 (2022) - [j82]Tao Wang, Baoyindureng Wu:
The size of graphs with given feedback vertex number. Discret. Appl. Math. 314: 213-222 (2022) - [j81]Wanping Zhang, Jixiang Meng, Baoyindureng Wu:
Extremal graphs with respect to two distance-based topological indices. Discret. Appl. Math. 317: 63-74 (2022) - [j80]Bo Zhang, Baoyindureng Wu:
Graphs G in which G-N[v] has a prescribed property for each vertex v. Discret. Appl. Math. 318: 13-20 (2022) - [j79]Xiang Qin, Baoyindureng Wu:
Decomposition of graphs with constraint on minimum degree. Discret. Appl. Math. 321: 64-71 (2022) - [j78]Fengxia Liu, Baoyindureng Wu, Jixiang Meng:
Arbitrarily partitionable 2K2, C4-free graphs. Discuss. Math. Graph Theory 42(2): 485-500 (2022) - [j77]Huijuan Yu, Baoyindureng Wu:
Admissible Property of Graphs in Terms of Radius. Graphs Comb. 38(1): 6 (2022) - [j76]Wei Yang, Baoyindureng Wu:
Injective Edge-Coloring of Graphs with Small Weight. Graphs Comb. 38(6): 178 (2022) - [j75]Wei Yang, Baoyindureng Wu:
Broadcast Domination in Subcubic Graphs. Graphs Comb. 38(6): 181 (2022) - [j74]Wanping Zhang, Jixiang Meng, Baoyindureng Wu:
The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees. J. Comb. Optim. 44(2): 1199-1220 (2022) - [j73]Lingmei Liang, Fengxia Liu, Baoyindureng Wu:
On r-hued coloring of product graphs. RAIRO Oper. Res. 56(6): 3845-3852 (2022) - 2021
- [j72]Zhonghua Li, Baoyindureng Wu:
The k-independence number of t-connected graphs. Appl. Math. Comput. 409: 126412 (2021) - [j71]Bo Zhang, Baoyindureng Wu:
Anti-Eulerian digraphs. Appl. Math. Comput. 411: 126513 (2021) - [j70]Baoyindureng Wu, Heping Zhang:
Graphs where each spanning tree has a perfect matching. Contributions Discret. Math. 16(3): 1-8 (2021) - [j69]Huiqiu Lin, Bo Ning, Baoyindureng Wu:
Eigenvalues and triangles in graphs. Comb. Probab. Comput. 30(2): 258-270 (2021) - [j68]Fangxia Wang, Baoyindureng Wu:
Disproofs of two conjectures on no hole anti-n-labeling of graphs. Discret. Appl. Math. 300: 72-76 (2021) - [j67]Wei Yang, Baoyindureng Wu:
Proof of a conjecture on the strong chromatic index of Halin graphs. Discret. Appl. Math. 302: 92-102 (2021) - [j66]Gang Zhang, Baoyindureng Wu:
K1, 2-isolation in graphs. Discret. Appl. Math. 304: 365-374 (2021) - [j65]Huijuan Yu, Baoyindureng Wu:
Graphs in which G - N[v] is a cycle for each vertex v. Discret. Math. 344(9): 112519 (2021) - [j64]Miaomiao Zhuo, Qinqin Li, Baoyindureng Wu, Xinhui An:
Average Edge-Connectivity of Cubic Graphs. J. Interconnect. Networks 21(4): 2142002:1-2142002:15 (2021) - [j63]Xiang Qin, Yanhua Zhao, Baoyindureng Wu:
Wiener Index of k-Connected Graphs. J. Interconnect. Networks 21(4): 2142005:1-2142005:7 (2021) - 2020
- [j62]Hengzhe Li, Yuanyuan Lu, Baoyindureng Wu, Ankang Wei:
The κk-connectivity of line graphs. Discret. Appl. Math. 285: 1-8 (2020)
2010 – 2019
- 2019
- [j61]Lili Yuan, Baoyindureng Wu, Biao Zhao:
Feedback vertex number of Sierpiński-type graphs. Contributions Discret. Math. 14(1) (2019) - [j60]Yin Chen, Baoyindureng Wu:
On the geometric-arithmetic index of a graph. Discret. Appl. Math. 254: 268-273 (2019) - 2018
- [j59]Zixuan Yang, Baoyindureng Wu:
Strong edge chromatic index of the generalized Petersen graphs. Appl. Math. Comput. 321: 431-441 (2018) - [j58]Fengxia Liu, Baoyindureng Wu, Jixiang Meng:
Partitioning the Cartesian product of a tree and a cycle. Appl. Math. Comput. 332: 90-95 (2018) - [j57]Hengzhe Li, Baoyindureng Wu, Jixiang Meng, Yingbin Ma:
Steiner tree packing number and tree connectivity. Discret. Math. 341(7): 1945-1951 (2018) - [j56]Zhenzhen Li, Baoyindureng Wu:
Maximum value of conflict-free vertex-connection number of graphs. Discret. Math. Algorithms Appl. 10(5): 1850059:1-1850059:6 (2018) - [j55]Hengzhe Li, Baoyindureng Wu, Weihua Yang:
Making a dominating set of a graph connected. Discuss. Math. Graph Theory 38(4): 947-962 (2018) - [j54]Xiaoling Ma, Baoyindureng Wu, Xian'an Jin:
Edge-disjoint spanning trees and the number of maximum state circles of a graph. J. Comb. Optim. 35(4): 997-1008 (2018) - 2017
- [j53]Jan Ekstein, Baoyindureng Wu, Liming Xiong:
Connected Even Factors in the Square of Essentially 2-Edge-connected Graph. Electron. J. Comb. 24(3): 3 (2017) - [j52]Baoyindureng Wu, Clive Elphick:
Upper bounds for the achromatic and coloring numbers of a graph. Discret. Appl. Math. 217: 375-380 (2017) - [j51]Fangxia Wang, Baoyindureng Wu, Xinhui An:
A -decomposition of tournaments and bipartite digraphs. Discret. Appl. Math. 226: 158-165 (2017) - [j50]Xiao Wang, Baoyindureng Wu:
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree. J. Comb. Optim. 33(1): 28-34 (2017) - [j49]Zixing Tang, Baoyindureng Wu, Lin Hu, Manouchehr Zaker:
More bounds for the Grundy number of graphs. J. Comb. Optim. 33(2): 580-589 (2017) - [j48]Wei Yang, Xinhui An, Baoyindureng Wu:
Paired-domination number of claw-free odd-regular graphs. J. Comb. Optim. 33(4): 1266-1275 (2017) - [j47]Huiqiu Lin, Jinlong Shu, Baoyindureng Wu:
Nordhaus-Gaddum type result for the matching number of a graph. J. Comb. Optim. 34(3): 916-930 (2017) - 2016
- [j46]Xiaoling Ma, Hong-Jian Lai, Wei Xiong, Baoyingdureng Wu, Xinhui An:
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs. Discret. Appl. Math. 202: 111-130 (2016) - [j45]Leihao Lu, Baoyindureng Wu, Zixing Tang:
Proof of a conjecture on the zero forcing number of a graph. Discret. Appl. Math. 213: 233-237 (2016) - [j44]Huiqiu Lin, Kinkar Chandra Das, Baoyindureng Wu:
Remoteness and distance eigenvalues of a graph. Discret. Appl. Math. 215: 218-224 (2016) - [j43]Hengzhe Li, Yuxing Yang, Baoyindureng Wu:
2-Edge connected dominating sets and 2-Connected dominating sets of a graph. J. Comb. Optim. 31(2): 713-724 (2016) - [j42]Huiqiu Lin, Jinlong Shu, Baoyindureng Wu:
Maximum size of digraphs with some parameters. J. Comb. Optim. 32(3): 941-950 (2016) - 2015
- [j41]Tingting Zhu, Baoyindureng Wu:
Domination of maximal K4-minor free graphs and maximal K2, 3-minor free graphs, and disproofs of two conjectures on planar graphs. Discret. Appl. Math. 194: 147-153 (2015) - [j40]Fenling Xu, Baoyindureng Wu, Qinqin Li:
The clique-transversal number of a {K1, 3, K4}-free 4-regular graph. Discret. Math. 338(7): 1126-1130 (2015) - [j39]Yang Zhao, Baoyindureng Wu:
Star decomposition of graphs. Discret. Math. Algorithms Appl. 7(2): 1550016:1-1550016:9 (2015) - [j38]Wei Wang, Baoyindureng Wu, Zhidan Yan, Nini Xue:
A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs. Graphs Comb. 31(5): 1779-1787 (2015) - 2014
- [j37]Baoyindureng Wu, Wanping Zhang:
Average distance, radius and remoteness of a graph. Ars Math. Contemp. 7(2): 441-452 (2014) - [j36]Xiaojing Yang, Baoyindureng Wu:
[1, 2]-domination in graphs. Discret. Appl. Math. 175: 79-86 (2014) - [j35]Baoyindureng Wu, Juan Yan, Xiaojing Yang:
Randić index and coloring number of a graph. Discret. Appl. Math. 178: 163-165 (2014) - [j34]Shipeng Wang, Baoyindureng Wu, Xinhui An, Xiaoping Liu, Xingchao Deng:
Outer-connected domination in 2-connected cubic graphs. Discret. Math. Algorithms Appl. 6(3) (2014) - [j33]Baoyindureng Wu, Xinhui An:
Disproof of the group coloring version of the Hadwiger conjecture. Discret. Math. Algorithms Appl. 6(3) (2014) - [j32]Xiaoping Liu, Zhilan Dang, Baoyindureng Wu:
The hub number, girth and Mycielski graphs. Inf. Process. Lett. 114(10): 561-563 (2014) - 2013
- [j31]Lingyan Zhen, Baoyindureng Wu:
Hamiltonicity of transformation graph G+ - . Ars Comb. 108: 117-127 (2013) - [j30]Baoyindureng Wu, Xingchao Deng, Xinhui An, Guiying Yan:
A Note on Semi-coloring of Graphs. Graphs Comb. 29(4): 1135-1140 (2013) - [j29]Baoyindureng Wu, Xinhui An, Guojie Liu, Guiying Yan, Xiaoping Liu:
Minimum degree, edge-connectivity and radius. J. Comb. Optim. 26(3): 585-591 (2013) - 2012
- [j28]Xingchao Deng, Kai-Nan Xiang, Baoyindureng Wu:
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs. Appl. Math. Lett. 25(3): 237-244 (2012) - [j27]Nini Xue, Baoyindureng Wu:
List Point Arboricity of Graphs. Discret. Math. Algorithms Appl. 4(2) (2012) - [j26]Beibei Ma, Baoyindureng Wu, Wanping Zhang:
Proximity and average eccentricity of a graph. Inf. Process. Lett. 112(10): 392-395 (2012) - 2011
- [j25]Fang Duan, Baoyindureng Wu:
On chromatic number of graphs without certain induced subgraphs. Ars Comb. 101: 33-44 (2011) - [j24]Daobin Li, Baoyindureng Wu, Xunuan Yang, Xinhui An:
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts. Discret. Appl. Math. 159(15): 1594-1600 (2011) - [j23]Yun Wang, Baoyindureng Wu:
Proof of a conjecture on connectivity of Kronecker product of graphs. Discret. Math. 311(21): 2563-2565 (2011) - [j22]Weijuan Zhang, Baoyindureng Wu, Xinhui An:
The Hyper-Wiener Index of the kth Power of a Graph. Discret. Math. Algorithms Appl. 3(1): 17-24 (2011) - [j21]Xunuan Yang, Baoyindureng Wu, Guiying Yan:
On the Sum of Independence Number and Average Degree of a Graph. Discret. Math. Algorithms Appl. 3(2): 147-158 (2011) - [j20]Zhihua An, Baoyindureng Wu, Daobin Li, Yun Wang, Guifu Su:
Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts. Discret. Math. Algorithms Appl. 3(3): 305-310 (2011) - [j19]Baoyindureng Wu, Guojie Liu, Xinhui An, Guiying Yan, Xiaoping Liu:
A Conjecture on Average Distance and Diameter of a Graph. Discret. Math. Algorithms Appl. 3(3): 337-342 (2011) - 2010
- [j18]Xinhui An, Baoyindureng Wu:
HajóS-like Theorem for Group Coloring. Discret. Math. Algorithms Appl. 2(3): 433-436 (2010)
2000 – 2009
- 2009
- [j17]Lei Yi, Baoyindureng Wu:
The transformation graph G++-. Australas. J Comb. 44: 37-42 (2009) - [j16]Xiaoping Liu, Xinhui An, Baoyindureng Wu:
On perfect matchings of complements of line graphs. Ars Comb. 90 (2009) - [j15]Xinhui An, Baoyindureng Wu:
List linear arboricity of planar graphs. Discuss. Math. Graph Theory 29(3): 499-510 (2009) - [j14]Ehsan Chiniforooshan, Baoyindureng Wu:
Maximum values of Szeged index and edge-Szeged index of graphs. Electron. Notes Discret. Math. 34: 405-409 (2009) - [j13]Lingyan Zhen, Baoyindureng Wu:
List Point Arboricity of Dense Graphs. Graphs Comb. 25(1): 123-128 (2009) - [c2]Baoyindureng Wu, Xinhui An:
A Note on Edge Choosability and Degeneracy of Planar Graphs. COCOA 2009: 249-257 - 2008
- [j12]Xinhui An, Baoyindureng Wu:
The Wiener index of the kth power of a graph. Appl. Math. Lett. 21(5): 436-440 (2008) - [j11]Baoyindureng Wu, Li Zhang:
Disproof of a Conjecture on List Coloring. Ars Comb. 89 (2008) - [j10]Lan Xu, Baoyindureng Wu:
Transformation graph G-+-. Discret. Math. 308(22): 5144-5148 (2008) - [j9]Baoyindureng Wu, Li Zhang:
The minimum number of vertices for a triangle-free graph with chil(G)=4 is 11. Discret. Math. 308(23): 5342-5348 (2008) - [j8]Baoyindureng Wu, Xiaoping Liu, Xiaofeng Guo:
Super-connected and hyper-connected jump graphs. Int. J. Comput. Math. 85(12): 1765-1769 (2008) - 2007
- [j7]Xinhui An, Baoyindureng Wu:
Hamiltonicity of complements of middle graphs. Discret. Math. 307(9-10): 1178-1184 (2007) - 2006
- [j6]Baoyindureng Wu, Li Zhang:
Extension of a list coloring problem. Appl. Math. Lett. 19(2): 135-139 (2006) - [j5]Li Zhang, Baoyindureng Wu:
A note on the cover degeneracy of graphs. J. Graph Theory 51(2): 170-173 (2006) - 2005
- [j4]Baoyindureng Wu, Li Zhang, Zhao Zhang:
The transformation graph Gxyz when xyz=-++. Discret. Math. 296(2-3): 263-270 (2005) - [j3]Li Zhang, Baoyindureng Wu:
A note on 3-choosability of planar graphs without certain cycles. Discret. Math. 297(1-3): 206-209 (2005) - [c1]Guoyan Ma, Baoyindureng Wu:
Hamiltonicity of Complements of Total Graphs. CJCDGCGT 2005: 109-119 - 2004
- [j2]Li Zhang, Baoyindureng Wu:
Edge choosability of planar graphs without small cycles. Discret. Math. 283(1-3): 289-293 (2004) - [j1]Baoyindureng Wu, Jixiang Meng:
Hamiltonian jump graphs. Discret. Math. 289(1-3): 95-106 (2004)
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-08-23 19:29 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:
