Carl Johan Casselgren

45 papers B 1Journal 44

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Extending partial edge colorings of Cartesian products of graphs. Discuss. Math. Graph Theory Carl Johan Casselgren, Fikre B. Petros, Samuel Asefa Fufa
2025	J	`jnl`	General degree-eccentricity index of unicyclic graphs of given order, girth and maximum degree. Discret. Appl. Math. Carl Johan Casselgren, Mesfin Masre
2025	J	`jnl`	Near-interval edge colorings of graphs. Discret. Appl. Math. Carl Johan Casselgren, Michal Malafiejski, Krzysztof Pastuszak, Petros A. Petrosyan
2024	J	`jnl`	Brooks' theorem with forbidden colors. J. Graph Theory Carl Johan Casselgren
2024	J	`jnl`	Coloring Hypergraphs from Random Lists. Electron. J. Comb. Carl Johan Casselgren
2024	J	`jnl`	Edge precoloring extension of trees II. Discuss. Math. Graph Theory Carl Johan Casselgren, Fikre B. Petros
2024	J	`jnl`	Extending partial edge colorings of iterated cartesian products of cycles and paths. Discret. Math. Theor. Comput. Sci. Carl Johan Casselgren, Jonas B. Granholm, Fikre B. Petros
2023	J	`jnl`	Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules. Discret. Appl. Math. Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
2022	J	`jnl`	A note on one-sided interval edge colorings of bipartite graphs. Discret. Math. Carl Johan Casselgren
2022	J	`jnl`	Avoiding and Extending Partial Edge Colorings of Hypercubes. Graphs Comb. Carl Johan Casselgren, Per Johansson, Klas Markström
2022	J	`jnl`	Length-constrained cycle partition with an application to UAV routing. Optim. Methods Softw. Kai Hoppmann-Baum, Oleg Burdakov, Gioni Mexi, Carl Johan Casselgren, Thorsten Koch
2021	J	`jnl`	Edge precoloring extension of trees. Australas. J Comb. Carl Johan Casselgren, Fikre B. Petros
2021	J	`jnl`	Improper interval edge colorings of graphs. Discret. Appl. Math. Carl Johan Casselgren, Petros A. Petrosyan
2021	J	`jnl`	On star edge colorings of bipartite and subcubic graphs. Discret. Appl. Math. Carl Johan Casselgren, Jonas B. Granholm, André Raspaud
2021	J	`jnl`	Restricted Extension of Sparse Partial Edge Colorings of Complete graphs. Electron. J. Comb. Carl Johan Casselgren, Lan Anh Pham
2020	J	`jnl`	Edge precoloring extension of hypercubes. J. Graph Theory Carl Johan Casselgren, Klas Markström, Lan Anh Pham
2020	J	`jnl`	Latin cubes of even order with forbidden entries. Eur. J. Comb. Carl Johan Casselgren, Lan Anh Pham
2020	B	`conf`	Minimum Cycle Partition with Length Requirements. CPAIOR Kai Hoppmann, Gioni Mexi, Oleg Burdakov, Carl Johan Casselgren, Thorsten Koch
2020	J	`jnl`	Restricted extension of sparse partial edge colorings of hypercubes. Discret. Math. Carl Johan Casselgren, Klas Markström, Lan Anh Pham
2019	J	`jnl`	Cyclic deficiency of graphs. Discret. Appl. Math. Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
2019	J	`jnl`	Latin Cubes with Forbidden Entries. Electron. J. Comb. Carl Johan Casselgren, Klas Markström, Lan Anh Pham
2019	J	`jnl`	Restricted completion of sparse partial Latin squares. Comb. Probab. Comput. Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström
2019	J	`jnl`	Some results on the palette index of graphs. Discret. Math. Theor. Comput. Sci. Carl Johan Casselgren, Petros A. Petrosyan
2018	J	`jnl`	Coloring graphs of various maximum degree from random lists. Random Struct. Algorithms Carl Johan Casselgren
2018	J	`jnl`	Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs. Discret. Math. Carl Johan Casselgren, Hrant Khachatrian, Petros A. Petrosyan
2018	J	`jnl`	Some results on cyclic interval edge colorings of graphs. J. Graph Theory Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
2017	J	`jnl`	Coloring graphs of various maximum degree from random lists. CoRR Carl Johan Casselgren
2017	J	`jnl`	On interval and cyclic interval edge colorings of (3, 5)-biregular graphs. Discret. Math. Carl Johan Casselgren, Petros A. Petrosyan, Bjarne Toft
2016	J	`jnl`	Coloring Complete and Complete Bipartite Graphs from Random Lists. Graphs Comb. Carl Johan Casselgren, Roland Häggkvist
2016	J	`jnl`	Hadwiger's Conjecture for inflations of 3-chromatic graphs. Eur. J. Comb. Carl Johan Casselgren, Anders Sune Pedersen
2016	J	`jnl`	One-sided interval edge-colorings of bipartite graphs. Discret. Math. Carl Johan Casselgren, Bjarne Toft
2016	J	`jnl`	Restricted completion of sparse partial Latin squares. CoRR Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström
2016	J	`jnl`	Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results. J. Graph Theory Armen S. Asratian, Carl Johan Casselgren
2015	J	`jnl`	On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees. J. Graph Theory Carl Johan Casselgren, Bjarne Toft
2015	J	`jnl`	Restricted cycle factors and arc-decompositions of digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Carl Johan Casselgren
2014	J	`jnl`	Coloring graphs from random lists of fixed size. Random Struct. Algorithms Carl Johan Casselgren
2013	J	`jnl`	Avoiding Arrays of Odd Order by Latin Squares. Comb. Probab. Comput. Lina Jansson Andrén, Carl Johan Casselgren, Lars-Daniel Öhman
2013	J	`jnl`	Completing partial Latin squares with one filled row, column and symbol. Discret. Math. Carl Johan Casselgren, Roland Häggkvist
2012	J	`jnl`	Coloring graphs from random lists of size 2. Eur. J. Comb. Carl Johan Casselgren
2012	J	`jnl`	On avoiding some families of arrays. Discret. Math. Carl Johan Casselgren
2011	J	`jnl`	A Note on Path Factors of (3,4)-Biregular Bipartite Graphs. Electron. J. Comb. Carl Johan Casselgren
2011	J	`jnl`	Vertex coloring complete multipartite graphs from random lists of size 2. Discret. Math. Carl Johan Casselgren
2009	J	`jnl`	Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs. J. Graph Theory Armen S. Asratian, Carl Johan Casselgren, Jennifer Vandenbussche, Douglas B. West
2008	J	`jnl`	On Path Factors of (3, 4)-Biregular Bigraphs. Graphs Comb. Armen S. Asratian, Carl Johan Casselgren
2007	J	`jnl`	On interval edge colorings of (alpha, beta)-biregular bipartite graphs. Discret. Math. Armen S. Asratian, Carl Johan Casselgren