default search action
Search dblp for Publications
export results for "toc:db/journals/jct/jctb124.bht:"
@article{DBLP:journals/jct/BaloghLM17, author = {J{\'{o}}zsef Balogh and Allan Lo and Theodore Molla}, title = {Transitive triangle tilings in oriented graphs}, journal = {J. Comb. Theory {B}}, volume = {124}, pages = {64--87}, year = {2017}, url = {https://doi.org/10.1016/j.jctb.2016.12.004}, doi = {10.1016/J.JCTB.2016.12.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BaloghLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BeaudouFN17, author = {Laurent Beaudou and Florent Foucaud and Reza Naserasr}, title = {Homomorphism bounds and edge-colourings of K\({}_{\mbox{4}}\)-minor-free graphs}, journal = {J. Comb. Theory {B}}, volume = {124}, pages = {128--164}, year = {2017}, url = {https://doi.org/10.1016/j.jctb.2017.01.001}, doi = {10.1016/J.JCTB.2017.01.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BeaudouFN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BensmailHLMT17, author = {Julien Bensmail and Ararat Harutyunyan and Tien{-}Nam Le and Martin Merker and St{\'{e}}phan Thomass{\'{e}}}, title = {A proof of the Bar{\'{a}}t-Thomassen conjecture}, journal = {J. Comb. Theory {B}}, volume = {124}, pages = {39--55}, year = {2017}, url = {https://doi.org/10.1016/j.jctb.2016.12.006}, doi = {10.1016/J.JCTB.2016.12.006}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BensmailHLMT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/DayJ17, author = {A. Nicholas Day and J. Robert Johnson}, title = {Multicolour Ramsey numbers of odd cycles}, journal = {J. Comb. Theory {B}}, volume = {124}, pages = {56--63}, year = {2017}, url = {https://doi.org/10.1016/j.jctb.2016.12.005}, doi = {10.1016/J.JCTB.2016.12.005}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/DayJ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KuhnOTZ17, author = {Daniela K{\"{u}}hn and Deryk Osthus and Timothy Townsend and Yi Zhao}, title = {On the structure of oriented graphs and digraphs with forbidden tournaments or cycles}, journal = {J. Comb. Theory {B}}, volume = {124}, pages = {88--127}, year = {2017}, url = {https://doi.org/10.1016/j.jctb.2016.12.008}, doi = {10.1016/J.JCTB.2016.12.008}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KuhnOTZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/NenadovPSS17, author = {Rajko Nenadov and Yury Person and Nemanja Skoric and Angelika Steger}, title = {An algorithmic framework for obtaining lower bounds for random Ramsey problems}, journal = {J. Comb. Theory {B}}, volume = {124}, pages = {1--38}, year = {2017}, url = {https://doi.org/10.1016/j.jctb.2016.12.007}, doi = {10.1016/J.JCTB.2016.12.007}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/NenadovPSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Tidor17, author = {Jonathan Tidor}, title = {Dense binary PG(t - 1, 2)-free matroids have critical number t - 1 or t}, journal = {J. Comb. Theory {B}}, volume = {124}, pages = {165--179}, year = {2017}, url = {https://doi.org/10.1016/j.jctb.2017.01.003}, doi = {10.1016/J.JCTB.2017.01.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Tidor17.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.