activity
20142026
most citedA Sufficient condition for DP-4-colorability

5 citations · 12 across the 15 of their papers we have counts for

collaborators

18 papers

math.CO2026

Hamiltonian Properties of 3-Connected Claw-Free Graphs and Line Graphs of 3-Hypergraphs

Kenta Ozeki, Leilei Zhang

Motivated by Thomassen's well-known line graph conjecture, many researchers have explored sufficient conditions for claw-free graphs to be Hamiltonian or Hamilton-connected. In 199…

math.CO2022

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…

cs.DS2022

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…

cs.GT2022★ 1 cited

On Reachable Assignments under Dichotomous Preferences

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +4

We consider the problem of determining whether a target item assignment can be reached from an initial item assignment by a sequence of pairwise exchanges of items between agents.…

cs.GT2022

Reforming an Envy-Free Matching

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura +5

We consider the problem of reforming an envy-free matching when each agent is assigned a single item. Given an envy-free matching, we consider an operation to exchange the item of…

math.CO2021

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…