Jonas B. Granholm

activity

20182023

most citedA localization method in Hamiltonian graph theory

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

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020

A note on adaptable choosability and choosability with separation of planar graphs

Carl Johan Casselgren, Jonas B. Granholm, André Raspaud

Let $F$ be a (possibly improper) edge-coloring of a graph $G$ ; a vertex coloring of $G$ is \emph{adapted to} $F$ if no color appears at the same time on an edge and on its two endp…

math.CO2020★ 4 cited

On star edge colorings of bipartite and subcubic graphs

Carl Johan Casselgren, Jonas B. Granholm, André Raspaud

A star edge coloring of a graph is a proper edge coloring with no $2$ -colored path or cycle of length four. The star chromatic index $χ_{s t}^{'} (G)$ of $G$ is the minimum number $t$ f…