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

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.85, Iss.9, 2008-09, pp. : 1325-1331

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

Stability Number and f-Factors in Graphs

By Kouider Mekkia

Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. : 197-202

Springer Publishing Company

Access to resources Recommend Favorite

Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 4, 2018-04 ,pp. : 660-671

John Wiley & Sons Inc

Access to resources Recommend Favorite

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs

By Xu Jinquan Li Ping Miao Zhengke Wang Keke Lai Hong-Jian

International Journal of Computer Mathematics, Vol. 91, Iss. 8, 2014-08 ,pp. : 1662-1672

Taylor & Francis Ltd

Access to resources Recommend Favorite

On (g, f)-Uniform Graphs

By Liu Gui-zhen Liu Yan

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 1, 2005-02 ,pp. : 67-76

Springer Publishing Company

Access to resources Recommend Favorite

Randomly Orthogonal (g,f)-factorizations in Graphs

By Liu Gui-zhen Long He-ping

Acta Mathematicae Applicatae Sinica, Vol. 18, Iss. 3, 2002-09 ,pp. : 489-494

Springer Publishing Company

Access to resources Recommend Favorite