default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 136
Volume 136, May 2019
- Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in 6-connected graphs of bounded tree-width. 1-32 - Anita Liebenau
, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl:
Caterpillars in Erdős-Hajnal. 33-43 - Guillaume Chapuy, Guillem Perarnau:
Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture. 44-71 - Zilin Jiang:
On spectral radii of unraveled balls. 72-80 - Raphael Yuster:
On the exact maximum induced density of almost all graphs and their inducibility. 81-109 - Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster:
The removal lemma for tournaments. 110-134 - Bill Jackson, J. C. Owen:
Radically solvable graphs. 135-153 - Yan-Li Qin, Binzhou Xia, Sanming Zhou:
Stability of circulant graphs. 154-169 - Klavdija Kutnar, Dragan Marusic:
Odd extensions of transitive groups via symmetric graphs - The cubic case. 170-192 - Ahmad Abdi, Dabeen Lee:
Deltas, extended odd holes and their blockers. 193-203 - Jacob Fox, Xiaoyu He, Freddie Manners:
A proof of Tomescu's graph coloring conjecture. 204-221 - Peter Frankl:
Some exact results for multiply intersecting families. 222-248 - Tibor Jordán, Shin-ichi Tanigawa:
Global rigidity of triangulations with braces. 249-288 - Albert Atserias, Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis:
Quantum and non-signalling graph isomorphisms. 289-328 - Sammy Luo:
A counting lemma for binary matroids and applications to extremal problems. 329-359
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.
last updated on 2026-08-14 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
