Coverings of the Vertices of a Graph by Small Cycles

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.23, Iss.2, 2007-04, pp. : 135-143

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

Related content

Largest connected component of a star graph with faulty vertices

By Yang Xiaofan

International Journal of Computer Mathematics, Vol. 85, Iss. 12, 2008-12 ,pp. : 1771-1778

Taylor & Francis Ltd

Access to resources Recommend Favorite

Connectedness strength of two vertices in an uncertain graph

By Zhang Bo

International Journal of Computer Mathematics, Vol. 90, Iss. 2, 2013-02 ,pp. : 246-257

Taylor & Francis Ltd

Access to resources Recommend Favorite

Coloring the vertices of a graph with majority restrictions on colors

By Vizing V.

Journal of Applied and Industrial Mathematics, Vol. 4, Iss. 2, 2010-04 ,pp. : 270-275

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four

By Ando Kiyoshi Egawa Yoshimi

Graphs and Combinatorics, Vol. 23, Iss. 1, 2007-06 ,pp. : 99-115

Springer Publishing Company

Access to resources Recommend Favorite

Graph Designs for all Graphs with Six Vertices and Eight Edges

By Kang Qing-de Yuan Lan-dang Liu Shu-xia

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 3, 2005-08 ,pp. : 469-484

Springer Publishing Company

Access to resources Recommend Favorite