![](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/jctb136.bht:"
@article{DBLP:journals/jct/AbdiL19, author = {Ahmad Abdi and Dabeen Lee}, title = {Deltas, extended odd holes and their blockers}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {193--203}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.10.006}, doi = {10.1016/J.JCTB.2018.10.006}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/AbdiL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/AtseriasMRSSV19, author = {Albert Atserias and Laura Mancinska and David E. Roberson and Robert S{\'{a}}mal and Simone Severini and Antonios Varvitsiotis}, title = {Quantum and non-signalling graph isomorphisms}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {289--328}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.11.002}, doi = {10.1016/J.JCTB.2018.11.002}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/AtseriasMRSSV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/ChapuyP19, author = {Guillaume Chapuy and Guillem Perarnau}, title = {Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {44--71}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.09.004}, doi = {10.1016/J.JCTB.2018.09.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/ChapuyP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FoxGSY19, author = {Jacob Fox and Lior Gishboliner and Asaf Shapira and Raphael Yuster}, title = {The removal lemma for tournaments}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {110--134}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.10.001}, doi = {10.1016/J.JCTB.2018.10.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/FoxGSY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FoxHM19, author = {Jacob Fox and Xiaoyu He and Freddie Manners}, title = {A proof of Tomescu's graph coloring conjecture}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {204--221}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.10.005}, doi = {10.1016/J.JCTB.2018.10.005}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/FoxHM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Frankl19, author = {Peter Frankl}, title = {Some exact results for multiply intersecting families}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {222--248}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.11.001}, doi = {10.1016/J.JCTB.2018.11.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Frankl19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/JacksonO19, author = {Bill Jackson and J. C. Owen}, title = {Radically solvable graphs}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {135--153}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.10.002}, doi = {10.1016/J.JCTB.2018.10.002}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/JacksonO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Jiang19, author = {Zilin Jiang}, title = {On spectral radii of unraveled balls}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {72--80}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.09.003}, doi = {10.1016/J.JCTB.2018.09.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Jiang19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/JordanT19, author = {Tibor Jord{\'{a}}n and Shin{-}ichi Tanigawa}, title = {Global rigidity of triangulations with braces}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {249--288}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.11.003}, doi = {10.1016/J.JCTB.2018.11.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/JordanT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KawarabayashiNT19, author = {Ken{-}ichi Kawarabayashi and Serguei Norine and Robin Thomas and Paul Wollan}, title = {\emph{K}\({}_{\mbox{6}}\) minors in 6-connected graphs of bounded tree-width}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {1--32}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2017.08.006}, doi = {10.1016/J.JCTB.2017.08.006}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KawarabayashiNT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KutnarM19, author = {Klavdija Kutnar and Dragan Marusic}, title = {Odd extensions of transitive groups via symmetric graphs - The cubic case}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {170--192}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.10.003}, doi = {10.1016/J.JCTB.2018.10.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KutnarM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/LiebenauPSS19, author = {Anita Liebenau and Marcin Pilipczuk and Paul D. Seymour and Sophie Spirkl}, title = {Caterpillars in Erd{\H{o}}s-Hajnal}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {33--43}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.09.002}, doi = {10.1016/J.JCTB.2018.09.002}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/LiebenauPSS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Luo19, author = {Sammy Luo}, title = {A counting lemma for binary matroids and applications to extremal problems}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {329--359}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.11.004}, doi = {10.1016/J.JCTB.2018.11.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Luo19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/QinXZ19, author = {Yan{-}Li Qin and Binzhou Xia and Sanming Zhou}, title = {Stability of circulant graphs}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {154--169}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.10.004}, doi = {10.1016/J.JCTB.2018.10.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/QinXZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Yuster19, author = {Raphael Yuster}, title = {On the exact maximum induced density of almost all graphs and their inducibility}, journal = {J. Comb. Theory {B}}, volume = {136}, pages = {81--109}, year = {2019}, url = {https://doi.org/10.1016/j.jctb.2018.09.005}, doi = {10.1016/J.JCTB.2018.09.005}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Yuster19.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.