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 math.COShow all

7 papers · 1 filter

math.CO2023

Extending partial edge colorings of iterated cartesian products of cycles and paths

Carl Johan Casselgren, Jonas B. Granholm, Fikre B. Petros

We consider the problem of extending partial edge colorings of iterated cartesian products of even cycles and paths, focusing on the case when the precolored edges satisfy either a…

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

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)$ .…

math.CO2018★ 5 cited

A localization method in Hamiltonian graph theory

Armen S. Asratian, Jonas B. Granholm, Nikolay K. Khachatryan

The classical global criteria for the existence of Hamilton cycles only apply to graphs with large edge density and small diameter. In a series of papers Asratian and Khachatryan d…

math.CO2018★ 1 cited

Some local--global phenomena in locally finite graphs