7 citations · 19 across the 20 of their papers we have counts for
28 papers
Local measures of interval edge-uncolorability
Carl Johan Casselgren, Petros A. Petrosyan
An interval edge coloring of a graph is a proper edge coloring by integers such that the colors on the edges incident with any vertex form an interval of integers. Not all graphs a…
Single conflict coloring and palette sparsification of uniform hypergraphs
Carl Johan Casselgren, Kalle Eriksson
We introduce and investigate single conflict coloring in the setting of r-uniform hypergraphs. We establish some basic properties of this hypergraph coloring model and study a prob…
The edge chromatic transformation index of graphs
Armen S. Asratian, Carl Johan Casselgren
Given a graph or multigraph , let denote the minimum integer such that any proper --edge coloring of can be transformed into any other proper $χ'(…
Single conflict coloring, adaptable choosability and separation choosability
Carl Johan Casselgren, Kalle Eriksson
We study relations between three interrelated notions of graph (list) coloring: single conflict coloring, adapted list coloring and choosability with separation (with overlappi…
Brooks' theorem with forbidden colors
Carl Johan Casselgren
We consider extensions of Brooks' classic theorem on vertex coloring where some colors cannot be used on certain vertices. In particular we prove that if is a connected graph w…
Extending partial edge colorings of cartesian products of graphs
Carl Johan Casselgren, Fikre B. Petros, Samuel A. Fufa
We consider the problem of extending partial edge colorings of cartesian products of graphs. More specifically, we suggest the following Evans-type conjecture: If is a graph wh…