Aim
Analyzing the impact of geometric and topological information on the combinatorial structure of graphs is a fundamental challenge in graph theory. This has also been recognized as a key topic in the computational geometry community, particularly in the design of efficient algorithms. Representative topics include vertex or edge colorings, Hamiltonicity, sparsity, and forbidden structures in graphs embedded on surfaces or manifolds, as well as intersection and contact graphs of geometric objects. While these topics are classical, significant progress continues to be made in recent years.
The aim of this mini-symposium is to highlight recent advances in this field and provide a platform for exchanging ideas and fostering further developments.
Organizers
Dates and Venue
June 26th, 2025 @ Hotel Kanazwa (https://socg25.github.io/practical.html)
Registration
The workshop will be held as part of CG Week 2025, and full CG Week 2025 registration is required.
Program
15:50-16:05: Atsuyuki Miyashita, Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
16:05-16:20: Yuta Inoue, Three-edge-coloring cubic graphs on the torus
16:20-16:35: Kengo Enami, Embeddings of a graph into a surface with different weak chromatic numbers
short break
16:40-16:55: Yoshio Okamoto, Rerouting curves on the plane and other surfaces
16:55-17:25: Solomon Lo, Minors of non-hamiltonian graphs
short break
17:30-17:45: Masuda Atsunori, Minors and subdivisions in optimal 1-embedded graphs
17:45-18:00: Kenta Noguchi, Face sizes and the connectivity of the dual
short break
18:05-18:20: Henry Adams, Nonexistence of Borsuk graph homomorphisms
18:20-18:50: Sean Dewar, Erdős distance theory on graphs