![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/jct/jctb138.bht:"
@article{DBLP:journals/jct/Barrera-CruzFMM19, author = {Fidel Barrera{-}Cruz and Stefan Felsner and Tam{\'{a}}s M{\'{e}}sz{\'{a}}ros and Piotr Micek and Heather C. Smith and Libby Taylor and William T. Trotter}, title = {Separating tree-chromatic number from path-chromatic number}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {206--218}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.02.003}, doi = {10.1016/J.JCTB.2019.02.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Barrera-CruzFMM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Bednarska-Bzdega19, author = {Malgorzata Bednarska{-}Bzdega and Omri Ben{-}Eliezer and Lior Gishboliner and Tuan Tran}, title = {On the separation conjecture in Avoider-Enforcer games}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {41--77}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.01.003}, doi = {10.1016/J.JCTB.2019.01.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Bednarska-Bzdega19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BordenaveC19, author = {Charles Bordenave and Simon Coste}, title = {Graphs with prescribed local neighborhoods of their universal coverings}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {196--205}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.02.001}, doi = {10.1016/J.JCTB.2019.02.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BordenaveC19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FominP19, author = {Fedor V. Fomin and Michal Pilipczuk}, title = {On width measures and topological problems on semi-complete digraphs}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {78--165}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.01.006}, doi = {10.1016/J.JCTB.2019.01.006}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/FominP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FranklK19, author = {Peter Frankl and Andrey Kupavskii}, title = {Two problems on matchings in set families - In the footsteps of Erd{\H{o}}s and Kleitman}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {286--313}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.02.004}, doi = {10.1016/J.JCTB.2019.02.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/FranklK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HarutyunyanLTW19, author = {Ararat Harutyunyan and Tien{-}Nam Le and St{\'{e}}phan Thomass{\'{e}} and Hehui Wu}, title = {Coloring tournaments: From local to global}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {166--171}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.01.005}, doi = {10.1016/J.JCTB.2019.01.005}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/HarutyunyanLTW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HaxellKK19, author = {Penny Haxell and Michael Krivelevich and Gal Kronenberg}, title = {Goldberg's conjecture is true for random multigraphs}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {314--349}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.02.005}, doi = {10.1016/J.JCTB.2019.02.005}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/HaxellKK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Kunszenti-Kovacs19, author = {D{\'{a}}vid Kunszenti{-}Kov{\'{a}}cs and L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and Bal{\'{a}}zs Szegedy}, title = {Measures on the square as sparse graph limits}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {1--40}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.01.004}, doi = {10.1016/J.JCTB.2019.01.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Kunszenti-Kovacs19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/RobertsonST19, author = {Neil Robertson and Paul D. Seymour and Robin Thomas}, title = {Excluded minors in cubic graphs}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {219--285}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.02.002}, doi = {10.1016/J.JCTB.2019.02.002}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/RobertsonST19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/SahSSZ19, author = {Ashwin Sah and Mehtaab Sawhney and David Stoner and Yufei Zhao}, title = {The number of independent sets in an irregular graph}, journal = {J. Comb. Theory {B}}, volume = {138}, pages = {172--195}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2019.01.007}, doi = {10.1016/J.JCTB.2019.01.007}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/SahSSZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.