Tadashi Sakuma

activity

20122025

most citedPebble Exchange Group of Graphs

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

collaborators

Showing 2012Show all

3 papers · 1 filter

math.CO2012

Agent Arrangement Problem

Tomoki Nakamigawa, Tadashi Sakuma

An {\em arrangement} of an ordered pair $(G_{A}, G_{M})$ of graphs is defined as a function $f$ from $V (G_{A})$ to $V (G_{M})$ such that, for each vertex $c$ of $G_{M}$ , the vertex-set $f^{-1…

math.CO2012

On the balanced decomposition number

Tadashi Sakuma

A {\em balanced coloring} of a graph $G$ means a triple ${P_{1}, P_{2}, X}$ of mutually disjoint subsets of the vertex-set $V (G)$ such that $V (G) = P_{1} ⊎ P_{2} ⊎ X$ and $|P_1|=|P…

math.CO2012

On ideal minimally non-packing clutters

Kenji Kashiwabara, Tadashi Sakuma

We consider the following conjecture proposed by Cornuéjols, Guenin and Margot: every ideal minimally non-packing clutter has a transversal of size 2. For a clutter C, the tilde cl…