Edge-colorings of Km,n which forbid multicolored cycles

Authors

  • Fu, Hung-Lin
  • Lo, Yuan-Hsun
  • Pei, Ryo-Yu

Abstract

A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper,we study the proper edgecolorings of the complete bipartite graph Km,n which forbid multicolored cycles. Mainly,we prove that(1)for any integer k ≥ 2, if n ≥ 5k - 6, then any properly n-edge-colored Kk,n contains a multicolored C 2k,and(2)determine the order of the properly edge-colored complete bipartite graphs which forbid multicolored C6.

Published

2013-05-09

How to Cite

Fu, Hung-Lin, Lo, Yuan-Hsun, & Pei, Ryo-Yu. (2013). Edge-colorings of Km,n which forbid multicolored cycles. Utilitas Mathematica, 90. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/992

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.