NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS

E-ISSN： 1755-1633|81|3|473-480

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.81, Iss.3, 2010-06, pp. : 473-480

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

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

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

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

Cambridge University Press

Access to resources Recommend Favorite

The existence of even regular factors of regular graphs on the number of cut edges

By Fan Hong Liu Gui Liu Ji Long He

Acta Mathematica Sinica, Vol. 26, Iss. 12, 2010-12 ,pp. : 2305-2312

Springer Publishing Company

Access to resources Recommend Favorite

Neighbourhood Graphs of Cayley Graphs for Finitely-generated Groups

By Neuhauser M.

European Journal of Combinatorics, Vol. 23, Iss. 6, 2002-08 ,pp. : 733-740

Academic Press

Access to resources Recommend Favorite

The Existence of Selfcomplementary Circulant Graphs

By Froncek D. Rosa A. Siran J.

European Journal of Combinatorics, Vol. 17, Iss. 7, 1996-10 ,pp. : 625-628

Academic Press

Access to resources Recommend Favorite