105 citations · 165 across the 11 of their papers we have counts for
14 papers
Star coloring of sparse graphs
Yuehua Bu, Daniel W. Cranston, Mickaël Montassier +2
A proper coloring of the vertices of a graph is called a \emph{star coloring} if the union of every two color classes induces a star forest. The star chromatic number is t…
A note on adaptable choosability and choosability with separation of planar graphs
Carl Johan Casselgren, Jonas B. Granholm, André Raspaud
Let be a (possibly improper) edge-coloring of a graph ; a vertex coloring of is \emph{adapted to} if no color appears at the same time on an edge and on its two endp…
Injective edge-coloring of graphs with given maximum degree
Alexandr Kostochka, André Raspaud, Jingwei Xu
A coloring of edges of a graph is injective if for any two distinct edges and , the colors of and are distinct if they are at distance in or in a…
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 -colored path or cycle of length four. The star chromatic index of is the minimum number f…
Injective edge-coloring of sparse graphs
Baya Ferdjallah, Samia Kerdjoudj, Andre Raspaud
An injective edge-coloring of a graph is an edge-coloring such that if , , and are three consecutive edges in (they are consecutive if they form a path…
Cut-edges and regular factors in regular graphs of odd degree
Alexander V. Kostochka, André Raspaud, Bjarne Toft +2
We study -factors in -regular graphs. Hanson, Loten, and Toft proved that every -regular graph with at most cut-edges has a -factor. We generalize their…