Color degree sum conditions for properly colored spanning trees in edge-colored graphs

Mikio Kano, Shun ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima

研究成果: Article査読

抄録

For a vertex v of an edge-colored graph, the color degree of v is the number of colors appeared in edges incident with v. An edge-colored graph is called properly colored if no two adjacent edges have the same color. In this paper, we prove that if the minimum color degree sum of two adjacent vertices of an edge-colored connected graph G is at least |G|, then G has a properly colored spanning tree. This is a generalization of the result proved by Cheng, Kano and Wang. We also show the sharpness of this lower bound of the color degree sum.

本文言語English
論文番号112042
ジャーナルDiscrete Mathematics
343
11
DOI
出版ステータスPublished - 2020 11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント 「Color degree sum conditions for properly colored spanning trees in edge-colored graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル