default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarl Johan Casselgren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j42]Carl Johan Casselgren
, Mesfin Masre:
General degree-eccentricity index of unicyclic graphs of given order, girth and maximum degree. Discret. Appl. Math. 368: 30-44 (2025)- [j41]Carl Johan Casselgren, Michal Malafiejski, Krzysztof Pastuszak, Petros A. Petrosyan:
Near-interval edge colorings of graphs. Discret. Appl. Math. 372: 23-36 (2025) - [j40]Carl Johan Casselgren, Fikre B. Petros, Samuel Asefa Fufa:
Extending partial edge colorings of Cartesian products of graphs. Discuss. Math. Graph Theory 45(2): 483-507 (2025) - 2024
- [j39]Carl Johan Casselgren:
Coloring Hypergraphs from Random Lists. Electron. J. Comb. 31(4) (2024) - [j38]Carl Johan Casselgren, Fikre B. Petros:
Edge precoloring extension of trees II. Discuss. Math. Graph Theory 44(2): 613 (2024) - [j37]Carl Johan Casselgren, Jonas B. Granholm, Fikre B. Petros:
Extending partial edge colorings of iterated cartesian products of cycles and paths. Discret. Math. Theor. Comput. Sci. 26(2) (2024) - [j36]Carl Johan Casselgren:
Brooks' theorem with forbidden colors. J. Graph Theory 105(3): 373-385 (2024) - 2023
- [j35]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: 25-35 (2023) - 2022
- [j34]Carl Johan Casselgren:
A note on one-sided interval edge colorings of bipartite graphs. Discret. Math. 345(2): 112690 (2022) - [j33]Carl Johan Casselgren, Per Johansson, Klas Markström:
Avoiding and Extending Partial Edge Colorings of Hypercubes. Graphs Comb. 38(3): 79 (2022) - [j32]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): 2080-2116 (2022) - 2021
- [j31]Carl Johan Casselgren, Fikre B. Petros:
Edge precoloring extension of trees. Australas. J Comb. 81: 233-244 (2021) - [j30]Carl Johan Casselgren, Lan Anh Pham:
Restricted Extension of Sparse Partial Edge Colorings of Complete graphs. Electron. J. Comb. 28(2): 2 (2021) - [j29]Carl Johan Casselgren, Jonas B. Granholm, André Raspaud:
On star edge colorings of bipartite and subcubic graphs. Discret. Appl. Math. 298: 21-33 (2021) - [j28]Carl Johan Casselgren, Petros A. Petrosyan:
Improper interval edge colorings of graphs. Discret. Appl. Math. 305: 164-178 (2021) - 2020
- [j27]Carl Johan Casselgren, Klas Markström, Lan Anh Pham:
Restricted extension of sparse partial edge colorings of hypercubes. Discret. Math. 343(11): 112033 (2020) - [j26]Carl Johan Casselgren, Lan Anh Pham:
Latin cubes of even order with forbidden entries. Eur. J. Comb. 85 (2020) - [j25]Carl Johan Casselgren, Klas Markström, Lan Anh Pham:
Edge precoloring extension of hypercubes. J. Graph Theory 95(3): 410-444 (2020) - 2019
- [j24]Carl Johan Casselgren, Klas Markström, Lan Anh Pham:
Latin Cubes with Forbidden Entries. Electron. J. Comb. 26(1): 1 (2019) - [j23]Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström:
Restricted completion of sparse partial Latin squares. Comb. Probab. Comput. 28(5): 675-695 (2019) - [j22]Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan:
Cyclic deficiency of graphs. Discret. Appl. Math. 266: 171-185 (2019) - [j21]Carl Johan Casselgren, Petros A. Petrosyan:
Some results on the palette index of graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j20]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): 627-637 (2018) - [j19]Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan:
Some results on cyclic interval edge colorings of graphs. J. Graph Theory 87(2): 239-252 (2018) - [j18]Carl Johan Casselgren:
Coloring graphs of various maximum degree from random lists. Random Struct. Algorithms 52(1): 54-73 (2018) - 2017
- [j17]Carl Johan Casselgren, Petros A. Petrosyan, Bjarne Toft:
On interval and cyclic interval edge colorings of (3, 5)-biregular graphs. Discret. Math. 340(11): 2678-2687 (2017) - 2016
- [j16]Carl Johan Casselgren, Bjarne Toft:
One-sided interval edge-colorings of bipartite graphs. Discret. Math. 339(11): 2628-2639 (2016) - [j15]Carl Johan Casselgren, Anders Sune Pedersen:
Hadwiger's Conjecture for inflations of 3-chromatic graphs. Eur. J. Comb. 51: 99-108 (2016) - [j14]Carl Johan Casselgren, Roland Häggkvist:
Coloring Complete and Complete Bipartite Graphs from Random Lists. Graphs Comb. 32(2): 533-542 (2016) - [j13]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): 350-373 (2016) - 2015
- [j12]Jørgen Bang-Jensen, Carl Johan Casselgren:
Restricted cycle factors and arc-decompositions of digraphs. Discret. Appl. Math. 193: 80-93 (2015) - [j11]Carl Johan Casselgren, Bjarne Toft:
On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees. J. Graph Theory 80(2): 83-97 (2015) - 2014
- [j10]Carl Johan Casselgren:
Coloring graphs from random lists of fixed size. Random Struct. Algorithms 44(3): 317-327 (2014) - 2013
- [j9]Lina Jansson Andrén, Carl Johan Casselgren, Lars-Daniel Öhman:
Avoiding Arrays of Odd Order by Latin Squares. Comb. Probab. Comput. 22(2): 184-212 (2013) - [j8]Carl Johan Casselgren, Roland Häggkvist:
Completing partial Latin squares with one filled row, column and symbol. Discret. Math. 313(9): 1011-1017 (2013) - 2012
- [j7]Carl Johan Casselgren:
On avoiding some families of arrays. Discret. Math. 312(5): 963-972 (2012) - [j6]Carl Johan Casselgren:
Coloring graphs from random lists of size 2. Eur. J. Comb. 33(2): 168-181 (2012) - 2011
- [j5]Carl Johan Casselgren:
A Note on Path Factors of (3,4)-Biregular Bipartite Graphs. Electron. J. Comb. 18(1) (2011) - [j4]Carl Johan Casselgren:
Vertex coloring complete multipartite graphs from random lists of size 2. Discret. Math. 311(13): 1150-1157 (2011) - 2009
- [j3]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): 88-97 (2009) - 2008
- [j2]Armen S. Asratian, Carl Johan Casselgren:
On Path Factors of (3, 4)-Biregular Bigraphs. Graphs Comb. 24(5): 405-411 (2008) - 2007
- [j1]Armen S. Asratian, Carl Johan Casselgren:
On interval edge colorings of (alpha, beta)-biregular bipartite graphs. Discret. Math. 307(15): 1951-1956 (2007)
Conference and Workshop Papers
- 2020
- [c1]Kai Hoppmann, Gioni Mexi, Oleg Burdakov, Carl Johan Casselgren, Thorsten Koch:
Minimum Cycle Partition with Length Requirements. CPAIOR 2020: 273-282
Informal and Other Publications
- 2017
- [i2]Carl Johan Casselgren:
Coloring graphs of various maximum degree from random lists. CoRR abs/1701.00614 (2017) - 2016
- [i1]Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström:
Restricted completion of sparse partial Latin squares. CoRR abs/1608.07383 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
