Shinya Fujita

most citedDecomposing edge-colored graphs under color degree constraints

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2024

Monochromatic $k$ -connection of graphs

Qingqiong Cai, Shinya Fujita, Henry Liu +1

An edge-coloured path is monochromatic if all of its edges have the same colour. For a $k$ -connected graph $G$ , the monochromatic $k$ -connection number of $G$ , denoted by $m c_{k} (G)$ …

math.CO2017★ 1 cited

Decomposing edge-colored graphs under color degree constraints

Ruonan Li, Shinya Fujita, Guanghui Wang

For an edge-colored graph $G$ , the minimum color degree of $G$ means the minimum number of colors on edges which are adjacent to each vertex of $G$ . We prove that if $G$ is an edge…

Monochromatic k-connection of graphs

Decomposing edge-colored graphs under color degree constraints

Monochromatic $k$ -connection of graphs