Martin Merker

activity

20162019

k

in large 3-connected cubic graphs

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

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Counterexamples to Thomassen's conjecture on decomposition of cubic graphs

Thomas Bellitto, Tereza Klimošová, Martin Merker +2

We construct an infinite family of counterexamples to Thomassen's conjecture that the vertices of every 3-connected, cubic graph on at least 8 vertices can be colored blue and red…

math.CO2019

Gaps in the cycle spectrum of 3-connected cubic planar graphs

Martin Merker

We prove that, for every natural number $k$ , every sufficiently large 3-connected cubic planar graph has a cycle whose length is in $[k, 2 k + 9]$ . We also show that this bound is clos…

math.CO2019★ 4 cited

Cycle lengths modulo $k$ in large 3-connected cubic graphs

Kasper S. Lyngsie, Martin Merker

We prove that for all natural numbers $m$ and $k$ where $k$ is odd, there exists a natural number $N (k)$ such that any 3-connected cubic graph with at least $N (k)$ vertices contain…

Counterexamples to Thomassen's conjecture on decomposition of cubic graphs

Gaps in the cycle spectrum of 3-connected cubic planar graphs

Cycle lengths modulo k in large 3-connected cubic graphs

Cycle lengths modulo $k$ in large 3-connected cubic graphs