Carl Johan Casselgren

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 28

Top Topics

Bipartite Graph

Mutual Reinforcement

Top Venues

J. Graph Theory

Discret. Appl. Math.

Publications

Carl Johan Casselgren, Fikre B. Petros
Edge precoloring extension of trees II. Discuss. Math. Graph Theory 44 (2) (2024)
Carl Johan Casselgren
Brooks' theorem with forbidden colors. J. Graph Theory 105 (3) (2024)
Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules. Discret. Appl. Math. 335 (2023)
Carl Johan Casselgren
A note on one-sided interval edge colorings of bipartite graphs. Discret. Math. 345 (2) (2022)
Carl Johan Casselgren, Per Johansson, Klas Markström
Avoiding and Extending Partial Edge Colorings of Hypercubes. Graphs Comb. 38 (3) (2022)
Kai Hoppmann-Baum, Oleg Burdakov, Gioni Mexi, Carl Johan Casselgren, Thorsten Koch
Length-constrained cycle partition with an application to UAV routing. Optim. Methods Softw. 37 (6) (2022)
Carl Johan Casselgren, Petros A. Petrosyan
Improper interval edge colorings of graphs. Discret. Appl. Math. 305 (2021)
Carl Johan Casselgren, Lan Anh Pham
Restricted Extension of Sparse Partial Edge Colorings of Complete graphs. Electron. J. Comb. 28 (2) (2021)
Carl Johan Casselgren, Fikre B. Petros
Edge precoloring extension of trees. Australas. J Comb. 81 (2021)
Carl Johan Casselgren, Jonas B. Granholm, André Raspaud
On star edge colorings of bipartite and subcubic graphs. Discret. Appl. Math. 298 (2021)
Carl Johan Casselgren, Lan Anh Pham
Latin cubes of even order with forbidden entries. Eur. J. Comb. 85 (2020)
Kai Hoppmann, Gioni Mexi, Oleg Burdakov, Carl Johan Casselgren, Thorsten Koch
Minimum Cycle Partition with Length Requirements. CPAIOR (2020)
Carl Johan Casselgren, Klas Markström, Lan Anh Pham
Restricted extension of sparse partial edge colorings of hypercubes. Discret. Math. 343 (11) (2020)
Carl Johan Casselgren, Klas Markström, Lan Anh Pham
Edge precoloring extension of hypercubes. J. Graph Theory 95 (3) (2020)
Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström
Restricted completion of sparse partial Latin squares. Comb. Probab. Comput. 28 (5) (2019)
Carl Johan Casselgren, Klas Markström, Lan Anh Pham
Latin Cubes with Forbidden Entries. Electron. J. Comb. 26 (1) (2019)
Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
Cyclic deficiency of graphs. Discret. Appl. Math. 266 (2019)
Carl Johan Casselgren, Petros A. Petrosyan
Some results on the palette index of graphs. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Carl Johan Casselgren
Coloring graphs of various maximum degree from random lists. Random Struct. Algorithms 52 (1) (2018)
Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
Some results on cyclic interval edge colorings of graphs. J. Graph Theory 87 (2) (2018)
Carl Johan Casselgren, Hrant Khachatrian, Petros A. Petrosyan
Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs. Discret. Math. 341 (3) (2018)
Carl Johan Casselgren
Coloring graphs of various maximum degree from random lists. CoRR (2017)
Carl Johan Casselgren, Petros A. Petrosyan, Bjarne Toft
On interval and cyclic interval edge colorings of (3, 5)-biregular graphs. Discret. Math. 340 (11) (2017)
Carl Johan Casselgren, Roland Häggkvist
Coloring Complete and Complete Bipartite Graphs from Random Lists. Graphs Comb. 32 (2) (2016)
Carl Johan Casselgren, Anders Sune Pedersen
Hadwiger's Conjecture for inflations of 3-chromatic graphs. Eur. J. Comb. 51 (2016)
Armen S. Asratian, Carl Johan Casselgren
Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results. J. Graph Theory 82 (4) (2016)
Carl Johan Casselgren, Bjarne Toft
One-sided interval edge-colorings of bipartite graphs. Discret. Math. 339 (11) (2016)
Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström
Restricted completion of sparse partial Latin squares. CoRR (2016)
Jørgen Bang-Jensen, Carl Johan Casselgren
Restricted cycle factors and arc-decompositions of digraphs. Discret. Appl. Math. 193 (2015)
Carl Johan Casselgren, Bjarne Toft
On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees. J. Graph Theory 80 (2) (2015)
Carl Johan Casselgren
Coloring graphs from random lists of fixed size. Random Struct. Algorithms 44 (3) (2014)
Lina Jansson Andrén, Carl Johan Casselgren, Lars-Daniel Öhman
Avoiding Arrays of Odd Order by Latin Squares. Comb. Probab. Comput. 22 (2) (2013)
Carl Johan Casselgren, Roland Häggkvist
Completing partial Latin squares with one filled row, column and symbol. Discret. Math. 313 (9) (2013)
Carl Johan Casselgren
On avoiding some families of arrays. Discret. Math. 312 (5) (2012)
Carl Johan Casselgren
Coloring graphs from random lists of size 2. Eur. J. Comb. 33 (2) (2012)
Carl Johan Casselgren
A Note on Path Factors of (3,4)-Biregular Bipartite Graphs. Electron. J. Comb. 18 (1) (2011)
Carl Johan Casselgren
Vertex coloring complete multipartite graphs from random lists of size 2. Discret. Math. 311 (13) (2011)
Armen S. Asratian, Carl Johan Casselgren, Jennifer Vandenbussche, Douglas B. West
Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs. J. Graph Theory 61 (2) (2009)
Armen S. Asratian, Carl Johan Casselgren
On Path Factors of (3, 4)-Biregular Bigraphs. Graphs Comb. 24 (5) (2008)
Armen S. Asratian, Carl Johan Casselgren
On interval edge colorings of (alpha, beta)-biregular bipartite graphs. Discret. Math. 307 (15) (2007)