M. T. I. Oshiro

Decomposing highly edge-connected graphs into paths of any given length ☆

In 2006, Barat and Thomassen posed the following conjecture: for each tree

Decompositions of highly connected graphs into paths of length five

T

Decomposing highly connected graphs into paths of length five

, there exists a natural number

Path decompositions of regular graphs with prescribed girth

k_T

Decompositions of highly connected graphs into paths of any given length

such that, if

Decomposing regular graphs with prescribed girth into paths of given length

G

Kinetic clustering of points on the line

is a

Trajectory clustering of points in R

k_T

A MILP model for an extended version of the Flexible Job Shop Problem

-edge-connected graph and

Dynamic clustering of evolving networks: some results on the line

|E(G)|