default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 157
Volume 157, November 2022
- Pavel Klavík, Roman Nedela, Peter Zeman:
Jordan-like characterization of automorphism groups of planar graphs. 1-39 - Matthias Hamann
, Florian Lehner, Babak Miraftab, Tim Rühmann:
A Stallings type theorem for quasi-transitive graphs. 40-69 - Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Topological ubiquity of trees. 70-95 - Sergei Kiselev, Andrey Kupavskii:
Sharp bounds for the chromatic number of random Kneser graphs. 96-122 - Endre Csóka, Zoltán L. Blázsik, Zoltán Király, Dániel Lenger:
Upper bounds for the necklace folding problems. 123-143 - Tara Abrishami, Maria Chudnovsky, Kristina Vuskovic:
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree. 144-175
- Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster:
Ramsey number of 1-subdivisions of transitive tournaments. 176-183
- Mingqing Zhai, Huiqiu Lin:
Spectral extrema of Ks, t-minor free graphs - On a conjecture of M. Tait. 184-215 - József Balogh, Felix Christian Clemen, Letícia Mattos:
Counting r-graphs without forbidden configurations. 216-234 - Wenzhong Liu, Mark N. Ellingham, Dong Ye:
Minimal quadrangulations of surfaces. 235-262 - Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle:
Bounding χ by a fraction of Δ for graphs without large cliques. 263-282
- Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan:
Reconstructing the degree sequence of a sparse graph from a partial deck. 283-293
- Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa:
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. 294-345 - Hong Liu, Guanghui Wang, Donglei Yang:
Clique immersion in graphs without a fixed bipartite graph. 346-365 - Peter Frankl, Andrey Kupavskii:
The Erdős Matching Conjecture and concentration inequalities. 366-400 - Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk:
On objects dual to tree-cut decompositions. 401-428 - Songling Shan:
Chromatic index of dense quasirandom graphs. 429-450 - J. Pascal Gollin, Karl Heuer:
Characterising k-connected sets in infinite graphs. 451-499 - Ferenc Bencs, Péter Csikvári:
Evaluations of Tutte polynomials of regular graphs. 500-523 - Xuding Zhu:
Every nice graph is (1, 5)-choosable. 524-551
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 2025-05-05 00:31 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
