Jonas B. Granholm

activity

20192021

collaborators

3 papers

math.CO2021

On Hamiltonicity of regular graphs with bounded second neighborhoods

Armen S. Asratian, Jonas B. Granholm

Let $G (k)$ denote the set of connected $k$ -regular graphs $G$ , $k \geq 2$ , where the number of vertices at distance 2 from any vertex in $G$ does not exceed $k$ . Asratian (…

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.CO2019

Some cyclic properties of $L_{1}$ -graphs

Jonas B. Granholm

A graph $G$ is called an $L_{1}$ -graph if $d (u) + d (v) \geq ∣ N (u) \cup N (v) \cup N (w) ∣ - 1$ for every triple of vertices $u, v, w$ where $u$ and $v$ are at distance 2 and $w \in N (u) \cap N (v)$ .…

On Hamiltonicity of regular graphs with bounded second neighborhoods

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

Some cyclic properties of L1​-graphs

Some cyclic properties of $L_{1}$ -graphs