5 citations · 9 across the 6 of their papers we have counts for
9 papers · 1 filter
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…
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…
The Alon-Tarsi number of -minor-free graphs
Toshiki Abe, Seog-Jin Kim, Kenta Ozeki
In this paper, we show the following three theorems. Let be a -minor-free graph. Then Alon-Tarsi number of is at most , there exists a matching of such that…
On the minimum leaf number of cubic graphs
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput +1
The \emph{minimum leaf number} of a connected graph is defined as the minimum number of leaves of the spanning trees of . We present new results concerning t…
Single-conflict colouring
Zdeněk Dvořák, Louis Esperet, Ross J. Kang +1
Given a multigraph, suppose that each vertex is given a local assignment of colours to its incident edges. We are interested in whether there is a choice of one local colour pe…
A Sufficient condition for DP-4-colorability
Seog-Jin Kim, Kenta Ozeki
DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each ,…