NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS

E-ISSN： 1755-1633|77|2|277-283

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.77, Iss.2, 2008-04, pp. : 277-283

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

Notes on the binding numbers for (a, b, k)-critical graphs

Bulletin of the Australian Mathematical Society, Vol. 76, Iss. 2, 2007-10 ,pp. : 307-314

Cambridge University Press

Access to resources Recommend Favorite

On all fractional (a, b, k)-critical graphs

By Zhou Si Sun Zhi

Acta Mathematica Sinica, Vol. 30, Iss. 4, 2014-04 ,pp. : 696-702

Springer Publishing Company

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

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

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

Cambridge University Press

Access to resources Recommend Favorite

Dominating Sets in Planar Graphs

By Matheson L.R. Tarjan R.E.

European Journal of Combinatorics, Vol. 17, Iss. 6, 1996-08 ,pp. : 565-568

Academic Press

Access to resources Recommend Favorite