Hamiltonian jump graphs. - Baoyindureng Wu; Jixiang Meng (Discret. Math., 2004)

Edge choosability of planar graphs without small cycles. - Li Zhang 009; Baoyindureng Wu (Discret. Math., 2004)

Hamiltonicity of Complements of Total Graphs. - Guoyan Ma; Baoyindureng Wu (CJCDGCGT, 2005)

The transformation graph Gxyz when xyz=-++. - Baoyindureng Wu; Li Zhang 009; Zhao Zhang 002 (Discret. Math., 2005)

A note on 3-choosability of planar graphs without certain cycles. - Li Zhang 009; Baoyindureng Wu (Discret. Math., 2005)

Extension of a list coloring problem. - Baoyindureng Wu; Li Zhang 009 (Appl. Math. Lett., 2006)

A note on the cover degeneracy of graphs. - Li Zhang 009; Baoyindureng Wu (J. Graph Theory, 2006)

Hamiltonicity of complements of middle graphs. - Xinhui An; Baoyindureng Wu (Discret. Math., 2007)

The Wiener index of the kth power of a graph. - Xinhui An; Baoyindureng Wu (Appl. Math. Lett., 2008)

Disproof of a Conjecture on List Coloring. - Baoyindureng Wu; Li Zhang 009 (Ars Comb., 2008)

The minimum number of vertices for a triangle-free graph with chil(G)=4 is 11. - Baoyindureng Wu; Li Zhang 009 (Discret. Math., 2008)

Transformation graph G-+-. - Lan Xu; Baoyindureng Wu (Discret. Math., 2008)

Super-connected and hyper-connected jump graphs. - Baoyindureng Wu; Xiaoping Liu; Xiaofeng Guo (Int. J. Comput. Math., 2008)

A Note on Edge Choosability and Degeneracy of Planar Graphs. - Baoyindureng Wu; Xinhui An (COCOA, 2009)

The transformation graph G++-. - Lei Yi; Baoyindureng Wu (Australas. J Comb., 2009)

On perfect matchings of complements of line graphs. - Xiaoping Liu; Xinhui An; Baoyindureng Wu (Ars Comb., 2009)

List linear arboricity of planar graphs. - Xinhui An; Baoyindureng Wu (Discuss. Math. Graph Theory, 2009)

Maximum values of Szeged index and edge-Szeged index of graphs. - Ehsan Chiniforooshan; Baoyindureng Wu (Electron. Notes Discret. Math., 2009)

List Point Arboricity of Dense Graphs. - Lingyan Zhen; Baoyindureng Wu (Graphs Comb., 2009)

HajóS-like Theorem for Group Coloring. - Xinhui An; Baoyindureng Wu (Discret. Math. Algorithms Appl., 2010)

On chromatic number of graphs without certain induced subgraphs. - Fang Duan; Baoyindureng Wu (Ars Comb., 2011)

Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts. - Daobin Li; Baoyindureng Wu; Xunuan Yang; Xinhui An (Discret. Appl. Math., 2011)

Proof of a conjecture on connectivity of Kronecker product of graphs. - Yun Wang; Baoyindureng Wu (Discret. Math., 2011)

Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts. - Zhihua An; Baoyindureng Wu; Daobin Li; Yun Wang; Guifu Su (Discret. Math. Algorithms Appl., 2011)

A Conjecture on Average Distance and Diameter of a Graph. - Baoyindureng Wu; Guojie Liu; Xinhui An; Guiying Yan; Xiaoping Liu (Discret. Math. Algorithms Appl., 2011)

On the Sum of Independence Number and Average Degree of a Graph. - Xunuan Yang; Baoyindureng Wu; Guiying Yan (Discret. Math. Algorithms Appl., 2011)

The Hyper-Wiener Index of the kth Power of a Graph. - Weijuan Zhang; Baoyindureng Wu; Xinhui An (Discret. Math. Algorithms Appl., 2011)

Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs. - Xingchao Deng; Kai-Nan Xiang; Baoyindureng Wu (Appl. Math. Lett., 2012)

List Point Arboricity of Graphs. - Nini Xue; Baoyindureng Wu (Discret. Math. Algorithms Appl., 2012)

Proximity and average eccentricity of a graph. - Beibei Ma; Baoyindureng Wu; Wanping Zhang (Inf. Process. Lett., 2012)

Hamiltonicity of transformation graph G+ - . - Lingyan Zhen; Baoyindureng Wu (Ars Comb., 2013)

A Note on Semi-coloring of Graphs. - Baoyindureng Wu; Xingchao Deng; Xinhui An; Guiying Yan (Graphs Comb., 2013)

Minimum degree, edge-connectivity and radius. - Baoyindureng Wu; Xinhui An; Guojie Liu; Guiying Yan; Xiaoping Liu (J. Comb. Optim., 2013)

Average distance, radius and remoteness of a graph. - Baoyindureng Wu; Wanping Zhang (Ars Math. Contemp., 2014)

Randić index and coloring number of a graph. - Baoyindureng Wu; Juan Yan; Xiaojing Yang (Discret. Appl. Math., 2014)

[1, 2]-domination in graphs. - Xiaojing Yang; Baoyindureng Wu (Discret. Appl. Math., 2014)

Outer-connected domination in 2-connected cubic graphs. - Shipeng Wang; Baoyindureng Wu; Xinhui An; Xiaoping Liu; Xingchao Deng (Discret. Math. Algorithms Appl., 2014)

Disproof of the group coloring version of the Hadwiger conjecture. - Baoyindureng Wu; Xinhui An (Discret. Math. Algorithms Appl., 2014)

The hub number, girth and Mycielski graphs. - Xiaoping Liu; Zhilan Dang; Baoyindureng Wu (Inf. Process. Lett., 2014)

Domination of maximal K4-minor free graphs and maximal K2, 3-minor free graphs, and disproofs of two conjectures on planar graphs. - Tingting Zhu; Baoyindureng Wu (Discret. Appl. Math., 2015)

The clique-transversal number of a {K1, 3, K4}-free 4-regular graph. - Fenling Xu; Baoyindureng Wu; Qinqin Li (Discret. Math., 2015)

Star decomposition of graphs. - Yang Zhao; Baoyindureng Wu (Discret. Math. Algorithms Appl., 2015)

A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs. - Wei Wang 052; Baoyindureng Wu; Zhidan Yan; Nini Xue (Graphs Comb., 2015)

Remoteness and distance eigenvalues of a graph. - Huiqiu Lin; Kinkar Chandra Das; Baoyindureng Wu (Discret. Appl. Math., 2016)

Proof of a conjecture on the zero forcing number of a graph. - Leihao Lu; Baoyindureng Wu; Zixing Tang (Discret. Appl. Math., 2016)

Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs. - Xiaoling Ma; Hong-Jian Lai; Wei Xiong 002; Baoyingdureng Wu; Xinhui An (Discret. Appl. Math., 2016)

2-Edge connected dominating sets and 2-Connected dominating sets of a graph. - Hengzhe Li; Yuxing Yang; Baoyindureng Wu (J. Comb. Optim., 2016)

Maximum size of digraphs with some parameters. - Huiqiu Lin; Jinlong Shu; Baoyindureng Wu (J. Comb. Optim., 2016)

Connected Even Factors in the Square of Essentially 2-Edge-connected Graph. - Jan Ekstein; Baoyindureng Wu; Liming Xiong (Electron. J. Comb., 2017)

A -decomposition of tournaments and bipartite digraphs. - Fangxia Wang; Baoyindureng Wu; Xinhui An (Discret. Appl. Math., 2017)

Upper bounds for the achromatic and coloring numbers of a graph. - Baoyindureng Wu; Clive Elphick (Discret. Appl. Math., 2017)

Nordhaus-Gaddum type result for the matching number of a graph. - Huiqiu Lin; Jinlong Shu; Baoyindureng Wu (J. Comb. Optim., 2017)

More bounds for the Grundy number of graphs. - Zixing Tang; Baoyindureng Wu; Lin Hu; Manouchehr Zaker (J. Comb. Optim., 2017)

Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree. - Xiao Wang; Baoyindureng Wu (J. Comb. Optim., 2017)

Paired-domination number of claw-free odd-regular graphs. - Wei Yang; Xinhui An; Baoyindureng Wu (J. Comb. Optim., 2017)

Partitioning the Cartesian product of a tree and a cycle. - Fengxia Liu; Baoyindureng Wu; Jixiang Meng (Appl. Math. Comput., 2018)

Strong edge chromatic index of the generalized Petersen graphs. - Zixuan Yang; Baoyindureng Wu (Appl. Math. Comput., 2018)

Steiner tree packing number and tree connectivity. - Hengzhe Li; Baoyindureng Wu; Jixiang Meng; Yingbin Ma (Discret. Math., 2018)

Maximum value of conflict-free vertex-connection number of graphs. - Zhenzhen Li; Baoyindureng Wu (Discret. Math. Algorithms Appl., 2018)

Making a dominating set of a graph connected. - Hengzhe Li; Baoyindureng Wu; Weihua Yang (Discuss. Math. Graph Theory, 2018)

Edge-disjoint spanning trees and the number of maximum state circles of a graph. - Xiaoling Ma; Baoyindureng Wu; Xian'an Jin (J. Comb. Optim., 2018)

Feedback vertex number of Sierpiński-type graphs. - Lili Yuan; Baoyindureng Wu; Biao Zhao (Contributions Discret. Math., 2019)

On the geometric-arithmetic index of a graph. - Yin Chen; Baoyindureng Wu (Discret. Appl. Math., 2019)

The κk-connectivity of line graphs. - Hengzhe Li; Yuanyuan Lu; Baoyindureng Wu; Ankang Wei (Discret. Appl. Math., 2020)

The k-independence number of t-connected graphs. - Zhonghua Li; Baoyindureng Wu (Appl. Math. Comput., 2021)

Anti-Eulerian digraphs. - Bo Zhang; Baoyindureng Wu (Appl. Math. Comput., 2021)

Graphs where each spanning tree has a perfect matching. - Baoyindureng Wu; Heping Zhang (Contributions Discret. Math., 2021)

Eigenvalues and triangles in graphs. - Huiqiu Lin; Bo Ning 001; Baoyindureng Wu (Comb. Probab. Comput., 2021)

Disproofs of two conjectures on no hole anti-n-labeling of graphs. - Fangxia Wang; Baoyindureng Wu (Discret. Appl. Math., 2021)

Proof of a conjecture on the strong chromatic index of Halin graphs. - Wei Yang; Baoyindureng Wu (Discret. Appl. Math., 2021)

K1, 2-isolation in graphs. - Gang Zhang; Baoyindureng Wu (Discret. Appl. Math., 2021)

Graphs in which G - N[v] is a cycle for each vertex v. - Huijuan Yu; Baoyindureng Wu (Discret. Math., 2021)

Wiener Index of k-Connected Graphs. - Xiang Qin; Yanhua Zhao; Baoyindureng Wu (J. Interconnect. Networks, 2021)

Average Edge-Connectivity of Cubic Graphs. - Miaomiao Zhuo; Qinqin Li; Baoyindureng Wu; Xinhui An (J. Interconnect. Networks, 2021)

Proper-walk connection of hamiltonian digraphs. - Zhenzhen Li; Baoyindureng Wu (Appl. Math. Comput., 2022)

On S-packing edge-colorings of graphs with small edge weight. - Wei Yang; Baoyindureng Wu (Appl. Math. Comput., 2022)

Randić Index of a Line Graph. - Jiangfu Zhang; Baoyindureng Wu (Axioms, 2022)

Decomposition of graphs with constraint on minimum degree. - Xiang Qin; Baoyindureng Wu (Discret. Appl. Math., 2022)

The size of graphs with given feedback vertex number. - Tao Wang 177; Baoyindureng Wu (Discret. Appl. Math., 2022)

Disproofs of three conjectures on the power domination of graphs. - Wei Yang; Baoyindureng Wu (Discret. Appl. Math., 2022)

Extremal graphs with respect to two distance-based topological indices. - Wanping Zhang; Jixiang Meng; Baoyindureng Wu (Discret. Appl. Math., 2022)

Graphs G in which G-N[v] has a prescribed property for each vertex v. - Bo Zhang; Baoyindureng Wu (Discret. Appl. Math., 2022)

Arbitrarily partitionable 2K2, C4-free graphs. - Fengxia Liu; Baoyindureng Wu; Jixiang Meng (Discuss. Math. Graph Theory, 2022)

Injective Edge-Coloring of Graphs with Small Weight. - Wei Yang; Baoyindureng Wu (Graphs Comb., 2022)

Broadcast Domination in Subcubic Graphs. - Wei Yang; Baoyindureng Wu (Graphs Comb., 2022)

Admissible Property of Graphs in Terms of Radius. - Huijuan Yu; Baoyindureng Wu (Graphs Comb., 2022)

The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees. - Wanping Zhang; Jixiang Meng; Baoyindureng Wu (J. Comb. Optim., 2022)

Domination number and feedback vertex number of complements of line graphs. - Xiaohong Chen; Baoyindureng Wu (AKCE Int. J. Graphs Comb., 2022)

On r-hued coloring of product graphs. - Lingmei Liang; Fengxia Liu; Baoyindureng Wu (RAIRO Oper. Res., 2022)

Induced subgraphs of a tree with constraint degree. - Tao Wang 177; Baoyindureng Wu (Appl. Math. Comput., 2023)

Weak saturation number of a complete bipartite graph. - Tongtong Xu; Baoyindureng Wu (Appl. Math. Comput., 2023)

On Several Parameters of Super Line Graph L2(G). - Jiawei Meng; Baoyindureng Wu; Hongliang Ma (Axioms, 2023)

Harmonic index of a line graph. - Tao Wang 177; Baoyindureng Wu; Taishan Wang (Discret. Appl. Math., 2023)

Disproof of a conjecture on the rainbow triangles in arc-colored digraphs. - Wei Yang; Baoyindureng Wu (Discret. Appl. Math., 2023)

Conflict-Free Connection Number of Graphs with Four Bridges. - Zhenzhen Li; Baoyindureng Wu (Graphs Comb., 2023)

On packing S-colorings of subcubic graphs. - Wei Yang; Baoyindureng Wu (Discret. Appl. Math., 2023)

Dominating Sets Inducing Large Component in Graphs with Minimum Degree Two. - Wei Yang; Baoyindureng Wu (Graphs Comb., 2023)

k-isolation in graphs. - Gang Zhang; Baoyindureng Wu (Discret. Appl. Math., 2024)

Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two. - Wei Yang; Baoyindureng Wu (Discret. Math., 2024)

On the cycle isolation number of triangle-free graphs. - Gang Zhang; Baoyindureng Wu (Discret. Math., 2024)

Outer connected domination in maximal outerplanar graphs and beyond. - Wei Yang; Baoyindureng Wu (Discuss. Math. Graph Theory, 2024)

Orientations of graphs with maximum Wiener index. - Zhenzhen Li; Baoyindureng Wu (J. Graph Theory, 2024)

Maximum odd induced subgraph of a graph concerning its chromatic number. - Tao Wang 177; Baoyindureng Wu (J. Graph Theory, 2024)

On some conjectures on biclique graphs. - Yanfang Liang; Baoyindureng Wu (Discret. Appl. Math., 2024)

The k-Sombor Index of Trees. - Fangxia Wang; Baoyindureng Wu (Asia Pac. J. Oper. Res., 2024)

Cycle Isolation of Graphs with Small Girth. - Gang Zhang; Baoyindureng Wu (Graphs Comb., 2024)

The first general Zagreb index of graphs and their line graphs. - Shuting Cheng; Baoyindureng Wu (J. Appl. Math. Comput., 2024)

Graphs G where G-N[v] is a regular graph for each vertex v. - Bo Zhang; Baoyindureng Wu (Comput. Appl. Math., 2024)

Graphs G Where G-N[v] is a Tree for Each Vertex v. - Bo Zhang; Baoyindureng Wu (Graphs Comb., 2024)

An upper bound for neighbor-connectivity of graphs. - Hongliang Ma; Baoyindureng Wu (J. Comb. Optim., 2024)

Graphs whose the maximum size of an odd subgraph equal to ⌊n2⌋. - Si-Ao Xu; Baoyindureng Wu (Appl. Math. Comput., 2025)

Minimum degree and size conditions for the graphs of proper connection number 2. - Zhenzhen Li; Baoyindureng Wu (Discret. Appl. Math., 2025)

The outdegree power of oriented graphs. - Yuhe Ren; Baoyindureng Wu (Comput. Appl. Math., 2025)

Neighbor sum distinguishing index of K4-minor free graphs. - Wei Yang; Baoyindureng Wu (Graphs Comb., 2025)

Cycle isolation in graphs. - Yanfang Liang; Baoyindureng Wu (Discret. Appl. Math., 2026)