1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2018
-Chromatic spanning trees and forests
Kazuhiro Suzuki
A heterochromatic (or rainbow) graph is an edge-colored graph whose edges have distinct colors, that is, where each color appears at most once. In this paper, I propose a -c…
math.CO2011
An f-chromatic spanning forest of edge-colored complete bipartite graphs
Kazuhiro Suzuki
In 2001, Brualdi and Hollingsworth proved that an edge-colored balanced complete bipartite graph Kn,n with a color set C = {1,2,3,..., 2n-1} has a heterochromatic spanning tree if…
math.CO2011★ 1 cited
A generalization of heterochromatic graphs
Kazuhiro Suzuki
In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heteroch…