34
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Binding number and Hamiltonian (g, f)-factors in graphs II

, &
Pages 1325-1331 | Received 27 Jun 2006, Accepted 07 Jun 2007, Published online: 20 Aug 2008

References

  • Anderson , I. 1971 . Perfect matching of graph . J. Combin. Theory B , 10 : 183 – 186 .
  • Bondy , J. A. and Murty , U. S.R. 1976 . Graph Theory with Applications , London : Macmillan .
  • Dirac , G. A. 1952 . Some theorems on abstract graphs . Proc. London Math. Soc. , 2 : 69 – 81 .
  • Katerinis , P. 1985 . Minimum degree of a graph and the existence k-factor . Proc. Indian Acad. Sci. (Math. Sci.) , 94 : 123 – 127 .
  • Liu , G. and Zhang , L. 2000 . Factors and factorizations of graphs (in Chinese) . Adv. Math. , 29 : 289 – 296 .
  • Lovász , L. 1970 . Subgraphs with prescribed valencies . J. Combin. Theory , 8 : 391 – 416 .
  • Woodall , D. R. 1973 . The binding number of a graph and its Anderson number . J. Combin. Theory Ser. , B15 : 225 – 255 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.