Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 155
Volume 155, July 2022
- Nicolas Bousquet, Marc Heinrich:
A polynomial version of Cereceda's conjecture. 1-16 - Roman Nedela, Martin Skoviera:
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs. 17-44
- Raphael Steiner
:
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant. 45-51
- Alexander A. Razborov:
An extremal problem motivated by triangle-free strongly regular graphs. 52-82 - Zoltán Füredi, Dhruv Mubayi, Jason O'Neill, Jacques Verstraëte:
Extremal problems for pairs of triangles. 83-110 - Tibor Jordán, Shin-ichi Tanigawa:
Globally rigid powers of graphs. 111-140 - Alistair Benford, Richard Montgomery:
Trees with few leaves in tournaments. 141-170 - József Balogh, Lina Li, Andrew Treglown:
Tilings in vertex ordered graphs. 171-201 - Daryl Funk, Irene Pivotto, Daniel C. Slilaty:
Matrix representations of frame and lifted-graphic matroids correspond to gain functions. 202-255 - Xiaonan Liu, Zhiyu Wang, Xingxing Yu:
Counting Hamiltonian cycles in planar triangulations. 256-277 - Marthe Bonamy, Thomas Perrett, Luke Postle:
Colouring graphs with sparse neighbourhoods: Bounds and applications. 278-317 - Asaf Ferber, Matthew Kwan:
Dirac-type theorems in random hypergraphs. 318-357 - Amin Bahmanian, Anna Johnsen, Stefan Napirata:
Embedding connected factorizations. 358-373 - Xiaolin Wang, Yaojun Chen:
Optimal oriented diameter of graphs with diameter 3. 374-388
a service of 
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 2024-04-25 04:39 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:
