default search action
Journal of Combinatorial Theory, Series B, Volume 137
Volume 137, July 2019
- Claude Laflamme, Andrés Aranda, Dániel T. Soukup, Robert E. Woodrow:
Balanced independent sets in graphs omitting large cliques. 1-9 - Nishant Chandgotia, Igor Pak, Martin Tassy:
Kirszbraun-type theorems for graphs. 10-24 - Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang:
Cycle covers (III) - Compatible circuit decomposition and K5-transition minor. 25-54 - Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Avoiding long Berge cycles. 55-64 - Andrzej Grzesik, Ping Hu, Jan Volec:
Minimum number of edges that occur in odd cycles. 65-103 - János Pach, Géza Tóth:
Many touchings force many crossings. 104-111 - Yiting Jiang, Xuding Zhu:
Multiple list colouring triangle free planar graphs. 112-117 - Luke Morgan, Primoz Potocnik, Gabriel Verret:
Arc-transitive digraphs of given out-valency and with blocks of given size. 118-125 - Isolde Adler, Philipp Klaus Krause:
A lower bound on the tree-width of graphs with irrelevant vertices. 126-136 - Zdenek Dvorák, Sergey Norin:
Treewidth of graphs with balanced separations. 137-144 - Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. 145-177 - Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
Core forging and local limit theorems for the k-core of random graphs. 178-231 - Martin Dolezal, Jan Hladký:
Cut-norm and entropy minimization over weak⁎ limits. 232-263 - Dániel Gerbner, Abhishek Methuku, Máté Vizer:
Asymptotics for the Turán number of Berge-K2, t. 264-290 - Eduard Eiben, Robert Jajcay, Primoz Sparl:
Symmetry properties of generalized graph truncations. 291-315
- Nicolas Bousquet, William Lochet, Stéphan Thomassé:
A proof of the Erdős-Sands-Sauer-Woodrow conjecture. 316-319
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.