Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jctb/jctb148.bht:"
@article{DBLP:journals/jctb/AnastosF21, author = {Michael Anastos and Alan M. Frieze}, title = {A scaling limit for the length of the longest cycle in a sparse random graph}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {184--208}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2021.01.001}, doi = {10.1016/J.JCTB.2021.01.001}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jctb/AnastosF21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/AsratianGK21, author = {Armen S. Asratian and Jonas B. Granholm and Nikolay Khachatryan}, title = {A localization method in Hamiltonian graph theory}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {209--238}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.04.005}, doi = {10.1016/J.JCTB.2020.04.005}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jctb/AsratianGK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/GiannopoulouKRT21, author = {Archontia C. Giannopoulou and O{-}joung Kwon and Jean{-}Florent Raymond and Dimitrios M. Thilikos}, title = {A Menger-like property of tree-cut width}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {1--22}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.12.005}, doi = {10.1016/J.JCTB.2020.12.005}, timestamp = {Tue, 09 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jctb/GiannopoulouKRT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/GyoriLSZ21, author = {Ervin Gy{\"{o}}ri and Nathan Lemons and Nika Salia and Oscar Zamora}, title = {The structure of hypergraphs without long Berge cycles}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {239--250}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.04.007}, doi = {10.1016/J.JCTB.2020.04.007}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jctb/GyoriLSZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/KangKL21, author = {Dong Yeap Kang and Jaehoon Kim and Hong Liu}, title = {On the rational Tur{\'{a}}n exponents conjecture}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {149--172}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.12.003}, doi = {10.1016/J.JCTB.2020.12.003}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jctb/KangKL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/KnierimLMN21, author = {Charlotte Knierim and Maxime Larcher and Anders Martinsson and Andreas Noever}, title = {Long cycles, heavy cycles and cycle decompositions in digraphs}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {125--148}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.12.008}, doi = {10.1016/J.JCTB.2020.12.008}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jctb/KnierimLMN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/KnierimS21, author = {Charlotte Knierim and Pascal Su}, title = {\emph{K}\({}_{\mbox{\emph{r}}}\)-factors in graphs with low independence number}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {60--83}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.12.006}, doi = {10.1016/J.JCTB.2020.12.006}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jctb/KnierimS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/KovacsK21, author = {Istv{\'{a}}n Kov{\'{a}}cs and Young Soo Kwon}, title = {Regular Cayley maps for dihedral groups}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {84--124}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.12.002}, doi = {10.1016/J.JCTB.2020.12.002}, timestamp = {Tue, 09 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jctb/KovacsK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/KurkofkaMP21, author = {Jan Kurkofka and Ruben Melcher and Max Pitz}, title = {Approximating infinite graphs by normal trees}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {173--183}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.12.007}, doi = {10.1016/J.JCTB.2020.12.007}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jctb/KurkofkaMP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jctb/LiuM21, author = {Xizhi Liu and Dhruv Mubayi}, title = {The feasible region of hypergraphs}, journal = {J. Comb. Theory, Ser. {B}}, volume = {148}, pages = {23--59}, year = {2021}, url = {https://doi.org/10.1016/j.jctb.2020.12.004}, doi = {10.1016/J.JCTB.2020.12.004}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jctb/LiuM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.