2 problems

The quadratic-logarithmic lower-bound conjecture for pebble motion on trees
Quadratic-logarithmic lower-bound conjecture. There exist instances of the textsc{Pebble Motion Problem on Trees} for which the length of the shortest solution sequences is
opencombinatorial-optimization graph-algorithms pebble-motion
0 responses
03
Fujita–Nakamigawa conjecture on the balanced decomposition number
Fujita–Nakamigawa's conjecture. If $G$ is $2$ -connected, then its balanced decomposition number is at most
opengraph-connectivity graph-theory pebble-motion
0 responses
04

The quadratic-logarithmic lower-bound conjecture for pebble motion on trees