Baoxiang Tang

From MaRDI portal
Person:2748824

Available identifiers

zbMath Open tang.baoxiangMaRDI QIDQ2748824

List of research outcomes





PublicationDate of PublicationType
Classification and recursive method for perfect matching number of two kinds of special graphs2021-07-01Paper
Enumeration of perfect matchings of a type of 3-regular graphs2021-01-14Paper
Perfect matching counts for \(2\)-\(2n{P_5}\) and \(2\)-\(n{K_{1,1,1,3}}\) graphs2021-01-14Paper
Recursive method for perfect matching number in two types of graphs2020-10-27Paper
The nested recursive method of analytic formula of the number of perfect matchings for two types of graphs2020-10-27Paper
Perfect matching number of two kinds of graphs based on recursive method of matching vertex classification2020-10-27Paper
A recursive method for perfect matching number classified with saturation of a certain vertex2020-08-12Paper
Recursive method for the number of 1-factors in graphs2020-08-12Paper
The perfect matching number of three types of graphs based on the recursive method of matching a certain vertex classification2020-08-12Paper
Recursive method for perfect matching numbers by matching vertex classification2020-01-22Paper
Recurrence calculation of the perfect matchings number of two types of graphs2020-01-22Paper
The number of ordered splits where the components of a positive integer n are not less than 22020-01-22Paper
Classification and recursive method for 1-factor number of two kinds of special graphs2019-09-20Paper
https://portal.mardi4nfdi.de/entity/Q46236562019-02-22Paper
The graceful labeling of two kinds of graphs and their coronas2018-07-18Paper
The counting formula of the perfect matchings of three types of special graphs2018-05-25Paper
The number of perfect matchings of two types of particular graphs2018-01-29Paper
Counting formulas for the number of perfect matchings of three types of graphs2017-10-20Paper
The analytic formula of the number of perfect matchings of two types of graphs2017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52769842017-07-14Paper
Counting formulas of perfect matchings of two types of graphs2017-01-06Paper
The graceful labeling of two types graphs is constituted by cycles of length four2017-01-06Paper
The number of perfect matchings in two types of 3-regular graphs2016-10-06Paper
Graceful labeling of the corona for two kinds of graceful graphs2016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q52600522015-06-29Paper
The numbers of perfect matching in three types of 3-regular graphs2015-06-29Paper
https://portal.mardi4nfdi.de/entity/Q52606142015-06-29Paper
The enumeration of perfect matchings in two types of graphs2014-11-03Paper
Estimating the number of short cycles in a simple planar graph2014-11-03Paper
Four types of nested recursive methods for finding graph perfect matching numbers2014-11-03Paper
A recursive method for finding the number of perfect matchings of two types of graphs2014-06-30Paper
The analytic formulas of the number of perfect matchings for four types of graphs2014-06-30Paper
The number of perfect matchings in four types of particular graphs2013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q49259792013-06-20Paper
The number of perfect matchings in five types of graphs2013-06-20Paper
Counting formulas of the number of perfect matchings for four types of graphs2013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49010582013-01-24Paper
The number of perfect matchings in six types of graphs2013-01-24Paper
The number of perfect matchings in three types of graphs2013-01-24Paper
The number of the perfect matchings for three specific types of graphs2012-10-05Paper
A generating algorithm for all graceful labelings of graceful graphs2012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31700502011-09-29Paper
Enumeration of closed families of finite sets2011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30171722011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30545372010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q44392242003-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45431362002-11-19Paper
https://portal.mardi4nfdi.de/entity/Q45434262002-10-20Paper
The number of cycles in the square bipartite graphs \(B_{m\times n}\)2002-03-10Paper
https://portal.mardi4nfdi.de/entity/Q45279542001-07-30Paper

Research outcomes over time

This page was built for person: Baoxiang Tang