Qiuju Bian

From MaRDI portal
(Redirected from Person:277652)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
scientific article; zbMATH DE number 7578756 (Why is no real title available?)2022-08-31Paper
The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision.2017-12-15Paper
scientific article; zbMATH DE number 6750343 (Why is no real title available?)2017-07-19Paper
Independence number, connectivity and fractional \((g,f)\)-factors in graphs
Filomat
2017-07-19Paper
Correction of the paper ``Bicyclic graphs with extremal values of PI index
Discrete Applied Mathematics
2016-06-01Paper
The maximum matching energy of bicyclic graphs with even girth
Discrete Applied Mathematics
2016-05-02Paper
3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
Graphs and Combinatorics
2014-09-19Paper
Independence number and connectivity for fractional ID-\(k\)-factor-critical graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
2014-08-12Paper
Subdigraphs with orthogonal factorizations of digraphs. II
European Journal of Combinatorics
2014-03-25Paper
On toughness and \([a,b\)-factors]
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
2013-07-12Paper
scientific article; zbMATH DE number 5844238 (Why is no real title available?)2011-02-02Paper
Some results on fractional \(n\)-factor-critical graphs
Journal of Applied Mathematics and Computing
2008-02-22Paper
Connected factors in 2-connected claw-free graphs2007-04-05Paper
On toughness and \((g,f)\)-factors in bipartite graphs
Journal of Applied Mathematics and Computing
2007-01-29Paper
\((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs
Applied Mathematics. Series B (English Edition)
2005-02-24Paper


Research outcomes over time


This page was built for person: Qiuju Bian