3 papers
math.CO2026
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…
math.CO2025
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 $Ï…
math.CO2025
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…