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

E-ISSN： 1097-0118|87|4|660-671

ISSN： 0364-9024

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

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

Some graphs containing unique Hamiltonian cycles

By Lynch M. A. M.

International Journal of Mathematical Education in Science and Technology, Vol. 33, Iss. 2, 2002-03 ,pp. : 231-240

Taylor & Francis Ltd

Access to resources Recommend Favorite

Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition

By Jansson Jesper Tokuyama Takeshi

Graphs and Combinatorics, Vol. 20, Iss. 2, 2004-06 ,pp. : 205-222

Springer Publishing Company

Access to resources Recommend Favorite

Total Colorings Of Degenerate Graphs

By Isobe Shuji

Combinatorica, Vol. 27, Iss. 2, 2007-03 ,pp. : 167-182

Springer Publishing Company

Access to resources Recommend Favorite

On 3-colorings of Plane Graphs

By Xu Bao-gang

Acta Mathematicae Applicatae Sinica, Vol. 20, Iss. 4, 2004-11 ,pp. : 597-604

Springer Publishing Company

Access to resources Recommend Favorite

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees

By Jin Zemin Kano Mikio Li Xueliang Wei Bing

Journal of Combinatorial Optimization, Vol. 11, Iss. 4, 2006-06 ,pp. : 445-454

Springer Publishing Company

Access to resources Recommend Favorite