BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS

Publisher： Cambridge University Press

E-ISSN： 1755-1633|85|1|60-67

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.85, Iss.1, 2011-10, pp. : 60-67

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS

By  

Bulletin of the Australian Mathematical Society, Vol. 86, Iss. 2, 2012-02 ,pp. : 177-183

Cambridge University Press

Access to resources Recommend Favorite

Binding numbers for fractional ID-k-factor-critical graphs

By Zhou Si  

Acta Mathematica Sinica, Vol. 30, Iss. 1, 2014-01 ,pp. : 181-186

Springer Publishing Company

Access to resources Recommend Favorite

Saturated Graphs of Prescribed Minimum Degree

By  

Combinatorics, Probability & Computing, Vol. 26, Iss. 2, 2017-03 ,pp. : 201-207

Cambridge University Press

Access to resources Recommend Favorite

Minimum degree and minimum number of edge-disjoint trees

By Llado A.   Lopez S.C.  

Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. : 195-205

Elsevier

Access to resources Recommend Favorite

Vertex-disjoint K 1 + (K 1 ∪ K 2) in K 1,4-free graphs with minimum degree at least four

By Gao Yun   Zou Qing  

Acta Mathematica Sinica, Vol. 30, Iss. 4, 2014-04 ,pp. : 661-674

Springer Publishing Company

Access to resources Recommend Favorite