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

Author： Jin Zemin Kano Mikio Li Xueliang Wei Bing

ISSN： 1382-6905

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

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

Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. : 362-373

John Wiley & Sons Inc

Access to resources Recommend Favorite

Maximal matching and edge domination in complete multipartite graphs

By Song Wenyao Miao Lianying Wang Haichao Zhao Yancai

International Journal of Computer Mathematics, Vol. 91, Iss. 5, 2014-05 ,pp. : 857-862

Taylor & Francis Ltd

Access to resources Recommend Favorite

Bipartite 2‐Factorizations of Complete Multipartite Graphs

JOURNAL OF GRAPH THEORY, Vol. 78, Iss. 4, 2015-04 ,pp. : 287-294

John Wiley & Sons Inc

Access to resources Recommend Favorite

Rainbow spanning trees in complete graphs colored by one‐factorizations

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. : 333-346

John Wiley & Sons Inc

Access to resources Recommend Favorite

Edge-colored cube decompositions

By Adams Peter Bryant Darryn Jordon Heather

aequationes mathematicae, Vol. 72, Iss. 3, 2006-12 ,pp. : 213-224

Springer Publishing Company

Access to resources Recommend Favorite