7 papers
Basis sequence reconfiguration in the union of matroids
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi +2
Given a graph and two spanning trees and in , Spanning Tree Reconfiguration asks whether there is a step-by-step transformation from to such that all inter…
Reconfiguration of colorings in triangulations of the sphere
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi +4
In 1973, Fisk proved that any -coloring of a -colorable triangulation of the -sphere can be obtained from any -coloring by a sequence of Kempe-changes. On the other han…
Rerouting Planar Curves and Disjoint Paths
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura +5
In this paper, we consider a transformation of disjoint paths in a graph. For a graph and a pair of disjoint paths and connecting the same set o…
Independent set reconfiguration on directed graphs
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi +4
\textsc{Directed Token Sliding} asks, given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by repeatedly applying a…
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura +6
We initiate the study of -edge-connected orientations of undirected graphs through edge flips for . We prove that in every orientation of an undirected -edge-conne…
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with submatrices
Yuni Iwamasa
In this paper, we consider the problem of computing the entire sequence of the maximum degree of minors of a block-structured symbolic matrix (a generic partitioned polynomial matr…