Carl Johan Casselgren

Orcid: 0000-0002-2741-468X

According to our database1, Carl Johan Casselgren authored at least 37 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Brooks' theorem with forbidden colors.
J. Graph Theory, March, 2024

2023
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules.
Discret. Appl. Math., August, 2023

2022
Length-constrained cycle partition with an application to UAV routing.
Optim. Methods Softw., 2022

Avoiding and Extending Partial Edge Colorings of Hypercubes.
Graphs Comb., 2022

A note on one-sided interval edge colorings of bipartite graphs.
Discret. Math., 2022

2021
Improper interval edge colorings of graphs.
Discret. Appl. Math., 2021

On star edge colorings of bipartite and subcubic graphs.
Discret. Appl. Math., 2021

Restricted Extension of Sparse Partial Edge Colorings of Complete graphs.
Electron. J. Comb., 2021

Edge precoloring extension of trees.
Australas. J Comb., 2021

2020
Edge precoloring extension of hypercubes.
J. Graph Theory, 2020

Latin cubes of even order with forbidden entries.
Eur. J. Comb., 2020

Restricted extension of sparse partial edge colorings of hypercubes.
Discret. Math., 2020

Minimum Cycle Partition with Length Requirements.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Some results on the palette index of graphs.
Discret. Math. Theor. Comput. Sci., 2019

Cyclic deficiency of graphs.
Discret. Appl. Math., 2019

Restricted completion of sparse partial Latin squares.
Comb. Probab. Comput., 2019

Latin Cubes with Forbidden Entries.
Electron. J. Comb., 2019

2018
Coloring graphs of various maximum degree from random lists.
Random Struct. Algorithms, 2018

Some results on cyclic interval edge colorings of graphs.
J. Graph Theory, 2018

Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs.
Discret. Math., 2018

2017
On interval and cyclic interval edge colorings of (3, 5)-biregular graphs.
Discret. Math., 2017

2016
Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results.
J. Graph Theory, 2016

Coloring Complete and Complete Bipartite Graphs from Random Lists.
Graphs Comb., 2016

Hadwiger's Conjecture for inflations of 3-chromatic graphs.
Eur. J. Comb., 2016

One-sided interval edge-colorings of bipartite graphs.
Discret. Math., 2016

2015
On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees.
J. Graph Theory, 2015

Restricted cycle factors and arc-decompositions of digraphs.
Discret. Appl. Math., 2015

2014
Coloring graphs from random lists of fixed size.
Random Struct. Algorithms, 2014

2013
Completing partial Latin squares with one filled row, column and symbol.
Discret. Math., 2013

Avoiding Arrays of Odd Order by Latin Squares.
Comb. Probab. Comput., 2013

2012
Coloring graphs from random lists of size 2.
Eur. J. Comb., 2012

On avoiding some families of arrays.
Discret. Math., 2012

2011
Vertex coloring complete multipartite graphs from random lists of size 2.
Discret. Math., 2011

A Note on Path Factors of (3,4)-Biregular Bipartite Graphs.
Electron. J. Comb., 2011

2009
Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs.
J. Graph Theory, 2009

2008
On Path Factors of (3, 4)-Biregular Bigraphs.
Graphs Comb., 2008

2007
On interval edge colorings of (alpha, beta)-biregular bipartite graphs.
Discret. Math., 2007


  Loading...