7 citations · 44 across the 43 of their papers we have counts for
4 papers · 1 filter
Three-edge-coloring apex cubic graphs
Yuta Inoue, Ken-ichi Kawarabayashi, Rintaro Matsuo +3
A graph is \emph{apex} if has a vertex such that is planar. We prove that every -connected apex cubic graph is three-edge-colorable. This result gives the fina…
The Dominating 4-Colour Theorem
António Girão, Freddie Illingworth, Bojan Mohar +6
A "dominating -model" in a graph is a sequence of pairwise vertex-disjoint connected subgraphs of , such that whenever every vertex…
The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita +3
We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be ach…
Long cycles in vertex transitive digraphs
Matija Bucić, Kevin Hendrey, Bojan Mohar +2
One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this f…