Atsuyuki Miyashita

According to our database, Atsuyuki Miyashita authored at least 3 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring.

Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup

CoRR, March, 2026

Three-edge-coloring (Tait coloring) cubic graphs and nowhere-zero 4-flow for graphs on the torus.

Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2024

Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem.

Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024