Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Carl Johan Casselgren
@article{DBLP:journals/jgt/Casselgren24,
author = {Carl Johan Casselgren},
title = {Brooks' theorem with forbidden colors},
journal = {J. Graph Theory},
volume = {105},
number = {3},
pages = {373--385},
year = {2024},
url = {https://doi.org/10.1002/jgt.23039},
doi = {10.1002/JGT.23039},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Casselgren24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AsratianCP23,
author = {Armen S. Asratian and
Carl Johan Casselgren and
Petros A. Petrosyan},
title = {Decomposing graphs into interval colorable subgraphs and no-wait multi-stage
schedules},
journal = {Discret. Appl. Math.},
volume = {335},
pages = {25--35},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2022.07.015},
doi = {10.1016/J.DAM.2022.07.015},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AsratianCP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Casselgren22,
author = {Carl Johan Casselgren},
title = {A note on one-sided interval edge colorings of bipartite graphs},
journal = {Discret. Math.},
volume = {345},
number = {2},
pages = {112690},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2021.112690},
doi = {10.1016/J.DISC.2021.112690},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Casselgren22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CasselgrenJM22,
author = {Carl Johan Casselgren and
Per Johansson and
Klas Markstr{\"{o}}m},
title = {Avoiding and Extending Partial Edge Colorings of Hypercubes},
journal = {Graphs Comb.},
volume = {38},
number = {3},
pages = {79},
year = {2022},
url = {https://doi.org/10.1007/s00373-022-02485-z},
doi = {10.1007/S00373-022-02485-Z},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/CasselgrenJM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/Hoppmann-BaumBM22,
author = {Kai Hoppmann{-}Baum and
Oleg Burdakov and
Gioni Mexi and
Carl Johan Casselgren and
Thorsten Koch},
title = {Length-constrained cycle partition with an application to {UAV} routing},
journal = {Optim. Methods Softw.},
volume = {37},
number = {6},
pages = {2080--2116},
year = {2022},
url = {https://doi.org/10.1080/10556788.2022.2053972},
doi = {10.1080/10556788.2022.2053972},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/oms/Hoppmann-BaumBM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/CasselgrenP21,
author = {Carl Johan Casselgren and
Fikre B. Petros},
title = {Edge precoloring extension of trees},
journal = {Australas. {J} Comb.},
volume = {81},
pages = {233--244},
year = {2021},
url = {http://ajc.maths.uq.edu.au/pdf/81/ajc\_v81\_p233.pdf},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ajc/CasselgrenP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CasselgrenP21,
author = {Carl Johan Casselgren and
Lan Anh Pham},
title = {Restricted Extension of Sparse Partial Edge Colorings of Complete
graphs},
journal = {Electron. J. Comb.},
volume = {28},
number = {2},
pages = {2},
year = {2021},
url = {https://doi.org/10.37236/9552},
doi = {10.37236/9552},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CasselgrenP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CasselgrenGR21,
author = {Carl Johan Casselgren and
Jonas B. Granholm and
Andr{\'{e}} Raspaud},
title = {On star edge colorings of bipartite and subcubic graphs},
journal = {Discret. Appl. Math.},
volume = {298},
pages = {21--33},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.03.007},
doi = {10.1016/J.DAM.2021.03.007},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CasselgrenGR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CasselgrenP21,
author = {Carl Johan Casselgren and
Petros A. Petrosyan},
title = {Improper interval edge colorings of graphs},
journal = {Discret. Appl. Math.},
volume = {305},
pages = {164--178},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.08.038},
doi = {10.1016/J.DAM.2021.08.038},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CasselgrenP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CasselgrenMP20,
author = {Carl Johan Casselgren and
Klas Markstr{\"{o}}m and
Lan Anh Pham},
title = {Restricted extension of sparse partial edge colorings of hypercubes},
journal = {Discret. Math.},
volume = {343},
number = {11},
pages = {112033},
year = {2020},
url = {https://doi.org/10.1016/j.disc.2020.112033},
doi = {10.1016/J.DISC.2020.112033},
timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/CasselgrenMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CasselgrenP20,
author = {Carl Johan Casselgren and
Lan Anh Pham},
title = {Latin cubes of even order with forbidden entries},
journal = {Eur. J. Comb.},
volume = {85},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2019.103045},
doi = {10.1016/J.EJC.2019.103045},
timestamp = {Mon, 13 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/CasselgrenP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CasselgrenMP20,
author = {Carl Johan Casselgren and
Klas Markstr{\"{o}}m and
Lan Anh Pham},
title = {Edge precoloring extension of hypercubes},
journal = {J. Graph Theory},
volume = {95},
number = {3},
pages = {410--444},
year = {2020},
url = {https://doi.org/10.1002/jgt.22561},
doi = {10.1002/JGT.22561},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CasselgrenMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/HoppmannMBCK20,
author = {Kai Hoppmann and
Gioni Mexi and
Oleg Burdakov and
Carl Johan Casselgren and
Thorsten Koch},
editor = {Emmanuel Hebrard and
Nysret Musliu},
title = {Minimum Cycle Partition with Length Requirements},
booktitle = {Integration of Constraint Programming, Artificial Intelligence, and
Operations Research - 17th International Conference, {CPAIOR} 2020,
Vienna, Austria, September 21-24, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12296},
pages = {273--282},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58942-4\_18},
doi = {10.1007/978-3-030-58942-4\_18},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/HoppmannMBCK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CasselgrenMP19,
author = {Carl Johan Casselgren and
Klas Markstr{\"{o}}m and
Lan Anh Pham},
title = {Latin Cubes with Forbidden Entries},
journal = {Electron. J. Comb.},
volume = {26},
number = {1},
pages = {1},
year = {2019},
url = {https://doi.org/10.37236/8157},
doi = {10.37236/8157},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CasselgrenMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AndrenCM19,
author = {Lina Jansson Andr{\'{e}}n and
Carl Johan Casselgren and
Klas Markstr{\"{o}}m},
title = {Restricted completion of sparse partial Latin squares},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {675--695},
year = {2019},
url = {https://doi.org/10.1017/S096354831800055X},
doi = {10.1017/S096354831800055X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AndrenCM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AsratianCP19,
author = {Armen S. Asratian and
Carl Johan Casselgren and
Petros A. Petrosyan},
title = {Cyclic deficiency of graphs},
journal = {Discret. Appl. Math.},
volume = {266},
pages = {171--185},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.12.003},
doi = {10.1016/J.DAM.2018.12.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AsratianCP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/CasselgrenP19,
author = {Carl Johan Casselgren and
Petros A. Petrosyan},
title = {Some results on the palette index of graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {21},
number = {3},
year = {2019},
url = {https://doi.org/10.23638/DMTCS-21-3-11},
doi = {10.23638/DMTCS-21-3-11},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/CasselgrenP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CasselgrenKP18,
author = {Carl Johan Casselgren and
Hrant Khachatrian and
Petros A. Petrosyan},
title = {Some bounds on the number of colors in interval and cyclic interval
edge colorings of graphs},
journal = {Discret. Math.},
volume = {341},
number = {3},
pages = {627--637},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2017.11.001},
doi = {10.1016/J.DISC.2017.11.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/CasselgrenKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AsratianCP18,
author = {Armen S. Asratian and
Carl Johan Casselgren and
Petros A. Petrosyan},
title = {Some results on cyclic interval edge colorings of graphs},
journal = {J. Graph Theory},
volume = {87},
number = {2},
pages = {239--252},
year = {2018},
url = {https://doi.org/10.1002/jgt.22154},
doi = {10.1002/JGT.22154},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AsratianCP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Casselgren18,
author = {Carl Johan Casselgren},
title = {Coloring graphs of various maximum degree from random lists},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {54--73},
year = {2018},
url = {https://doi.org/10.1002/rsa.20725},
doi = {10.1002/RSA.20725},
timestamp = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Casselgren18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CasselgrenPT17,
author = {Carl Johan Casselgren and
Petros A. Petrosyan and
Bjarne Toft},
title = {On interval and cyclic interval edge colorings of (3, 5)-biregular
graphs},
journal = {Discret. Math.},
volume = {340},
number = {11},
pages = {2678--2687},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.09.020},
doi = {10.1016/J.DISC.2016.09.020},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/CasselgrenPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Casselgren17,
author = {Carl Johan Casselgren},
title = {Coloring graphs of various maximum degree from random lists},
journal = {CoRR},
volume = {abs/1701.00614},
year = {2017},
url = {http://arxiv.org/abs/1701.00614},
eprinttype = {arXiv},
eprint = {1701.00614},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Casselgren17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CasselgrenT16,
author = {Carl Johan Casselgren and
Bjarne Toft},
title = {One-sided interval edge-colorings of bipartite graphs},
journal = {Discret. Math.},
volume = {339},
number = {11},
pages = {2628--2639},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2016.05.003},
doi = {10.1016/J.DISC.2016.05.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CasselgrenT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CasselgrenP16,
author = {Carl Johan Casselgren and
Anders Sune Pedersen},
title = {Hadwiger's Conjecture for inflations of 3-chromatic graphs},
journal = {Eur. J. Comb.},
volume = {51},
pages = {99--108},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.05.003},
doi = {10.1016/J.EJC.2015.05.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/CasselgrenP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CasselgrenH16,
author = {Carl Johan Casselgren and
Roland H{\"{a}}ggkvist},
title = {Coloring Complete and Complete Bipartite Graphs from Random Lists},
journal = {Graphs Comb.},
volume = {32},
number = {2},
pages = {533--542},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1587-5},
doi = {10.1007/S00373-015-1587-5},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/CasselgrenH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AsratianC16,
author = {Armen S. Asratian and
Carl Johan Casselgren},
title = {Solution of Vizing's Problem on Interchanges for the case of Graphs
with Maximum Degree 4 and Related Results},
journal = {J. Graph Theory},
volume = {82},
number = {4},
pages = {350--373},
year = {2016},
url = {https://doi.org/10.1002/jgt.21906},
doi = {10.1002/JGT.21906},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AsratianC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AndrenCM16,
author = {Lina Jansson Andr{\'{e}}n and
Carl Johan Casselgren and
Klas Markstr{\"{o}}m},
title = {Restricted completion of sparse partial Latin squares},
journal = {CoRR},
volume = {abs/1608.07383},
year = {2016},
url = {http://arxiv.org/abs/1608.07383},
eprinttype = {arXiv},
eprint = {1608.07383},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AndrenCM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bang-JensenC15,
author = {J{\o}rgen Bang{-}Jensen and
Carl Johan Casselgren},
title = {Restricted cycle factors and arc-decompositions of digraphs},
journal = {Discret. Appl. Math.},
volume = {193},
pages = {80--93},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.04.020},
doi = {10.1016/J.DAM.2015.04.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bang-JensenC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CasselgrenT15,
author = {Carl Johan Casselgren and
Bjarne Toft},
title = {On Interval Edge Colorings of Biregular Bipartite Graphs With Small
Vertex Degrees},
journal = {J. Graph Theory},
volume = {80},
number = {2},
pages = {83--97},
year = {2015},
url = {https://doi.org/10.1002/jgt.21841},
doi = {10.1002/JGT.21841},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CasselgrenT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Casselgren14,
author = {Carl Johan Casselgren},
title = {Coloring graphs from random lists of fixed size},
journal = {Random Struct. Algorithms},
volume = {44},
number = {3},
pages = {317--327},
year = {2014},
url = {https://doi.org/10.1002/rsa.20469},
doi = {10.1002/RSA.20469},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Casselgren14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AndrenCO13,
author = {Lina Jansson Andr{\'{e}}n and
Carl Johan Casselgren and
Lars{-}Daniel {\"{O}}hman},
title = {Avoiding Arrays of Odd Order by Latin Squares},
journal = {Comb. Probab. Comput.},
volume = {22},
number = {2},
pages = {184--212},
year = {2013},
url = {https://doi.org/10.1017/S0963548312000570},
doi = {10.1017/S0963548312000570},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AndrenCO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CasselgrenH13,
author = {Carl Johan Casselgren and
Roland H{\"{a}}ggkvist},
title = {Completing partial Latin squares with one filled row, column and symbol},
journal = {Discret. Math.},
volume = {313},
number = {9},
pages = {1011--1017},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.01.019},
doi = {10.1016/J.DISC.2013.01.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CasselgrenH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Casselgren12,
author = {Carl Johan Casselgren},
title = {On avoiding some families of arrays},
journal = {Discret. Math.},
volume = {312},
number = {5},
pages = {963--972},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.10.028},
doi = {10.1016/J.DISC.2011.10.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Casselgren12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Casselgren12,
author = {Carl Johan Casselgren},
title = {Coloring graphs from random lists of size 2},
journal = {Eur. J. Comb.},
volume = {33},
number = {2},
pages = {168--181},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2011.09.040},
doi = {10.1016/J.EJC.2011.09.040},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Casselgren12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Casselgren11,
author = {Carl Johan Casselgren},
title = {A Note on Path Factors of (3,4)-Biregular Bipartite Graphs},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/705},
doi = {10.37236/705},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Casselgren11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Casselgren11,
author = {Carl Johan Casselgren},
title = {Vertex coloring complete multipartite graphs from random lists of
size 2},
journal = {Discret. Math.},
volume = {311},
number = {13},
pages = {1150--1157},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2010.07.013},
doi = {10.1016/J.DISC.2010.07.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Casselgren11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AsratianCVW09,
author = {Armen S. Asratian and
Carl Johan Casselgren and
Jennifer Vandenbussche and
Douglas B. West},
title = {Proper path-factors and interval edge-coloring of (3, 4)-biregular
bigraphs},
journal = {J. Graph Theory},
volume = {61},
number = {2},
pages = {88--97},
year = {2009},
url = {https://doi.org/10.1002/jgt.20370},
doi = {10.1002/JGT.20370},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AsratianCVW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AsratianC08,
author = {Armen S. Asratian and
Carl Johan Casselgren},
title = {On Path Factors of (3, 4)-Biregular Bigraphs},
journal = {Graphs Comb.},
volume = {24},
number = {5},
pages = {405--411},
year = {2008},
url = {https://doi.org/10.1007/s00373-008-0803-y},
doi = {10.1007/S00373-008-0803-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AsratianC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AsratianC07,
author = {Armen S. Asratian and
Carl Johan Casselgren},
title = {On interval edge colorings of (alpha, beta)-biregular bipartite graphs},
journal = {Discret. Math.},
volume = {307},
number = {15},
pages = {1951--1956},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2006.11.001},
doi = {10.1016/J.DISC.2006.11.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AsratianC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-03-24 00:10 CET 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:
