Baoyindureng Wu
Orcid: 0000-0001-7164-3116
According to our database1,
Baoyindureng Wu authored at least 119 papers
between 2004 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2026
Comput. Appl. Math., March, 2026
A minimum degree condition for a 2-connected graph containing all possible orders of 2-connected subgraphs.
Discret. Appl. Math., 2026
Discret. Appl. Math., 2026
2025
Graphs Comb., August, 2025
Discret. Appl. Math., 2025
Appl. Math. Comput., 2025
2024
Comput. Appl. Math., July, 2024
J. Appl. Math. Comput., June, 2024
J. Graph Theory, 2024
Discuss. Math. Graph Theory, 2024
Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two.
Discret. Math., 2024
2023
Graphs Comb., October, 2023
Graphs Comb., June, 2023
Discret. Appl. Math., 2023
2022
AKCE Int. J. Graphs Comb., September, 2022
The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees.
J. Comb. Optim., 2022
Discuss. Math. Graph Theory, 2022
Discret. Appl. Math., 2022
Discret. Appl. Math., 2022
Discret. Appl. Math., 2022
Discret. Appl. Math., 2022
Appl. Math. Comput., 2022
2021
Discret. Math., 2021
Discret. Appl. Math., 2021
Discret. Appl. Math., 2021
Contributions Discret. Math., 2021
2020
2019
2018
J. Comb. Optim., 2018
Discret. Math. Algorithms Appl., 2018
Appl. Math. Comput., 2018
2017
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree.
J. Comb. Optim., 2017
J. Comb. Optim., 2017
Discret. Appl. Math., 2017
Electron. J. Comb., 2017
2016
J. Comb. Optim., 2016
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs.
Discret. Appl. Math., 2016
Discret. Appl. Math., 2016
2015
Graphs Comb., 2015
The clique-transversal number of a {K<sub>1, 3</sub>, K<sub>4</sub>}-free 4-regular graph.
Discret. Math., 2015
Domination of maximal K<sub>4</sub>-minor free graphs and maximal K<sub>2, 3</sub>-minor free graphs, and disproofs of two conjectures on planar graphs.
Discret. Appl. Math., 2015
2014
Discret. Math. Algorithms Appl., 2014
Discret. Math. Algorithms Appl., 2014
2013
Hamiltonicity of transformation graph G<sup>+ - </sup>.
Ars Comb., 2013
2012
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs.
Appl. Math. Lett., 2012
2011
Discret. Math. Algorithms Appl., 2011
Discret. Math. Algorithms Appl., 2011
Discret. Math. Algorithms Appl., 2011
Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts.
Discret. Math. Algorithms Appl., 2011
Discret. Math., 2011
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts.
Discret. Appl. Math., 2011
On chromatic number of graphs without certain induced subgraphs.
Ars Comb., 2011
2010
2009
Electron. Notes Discret. Math., 2009
On perfect matchings of complements of line graphs.
Ars Comb., 2009
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
The minimum number of vertices for a triangle-free graph with chi<sub>l</sub>(G)=4 is 11.
Discret. Math., 2008
Disproof of a Conjecture on List Coloring.
Ars Comb., 2008
2007
2006
2005
Discret. Math., 2005
Discret. Math., 2005
Proceedings of the Discrete Geometry, 2005
2004