![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Theory, Series B, Volume 154
Volume 154, May 2022
- A. Nicholas Day, Victor Falgas-Ravry, Andrew Treglown:
Extremal problems for multigraphs. 1-48 - Blas Fernández, Ademir Hujdurovic
:
Canonical double covers of circulants. 49-59 - Ahmad Abdi
, Gérard Cornuéjols, Matt Superdock
:
Clean tangled clutters, simplices, and projective geometries. 60-92 - Michael C. Laskowski, Caroline A. Terry
:
Jumps in speeds of hereditary properties in finite relational languages. 93-135 - Koyo Hayashi:
Linking four vertices in graphs of large connectivity. 136-174 - Leonardo Nagami Coregliano:
On the abstract chromatic number and its computability for finitely axiomatizable theories. 175-210 - Ignacio García-Marco
, Kolja Knauer:
On sensitivity in bipartite Cayley graphs. 211-238 - Nico Van Cleemput, Carol T. Zamfirescu
:
Hamiltonian cycles and 1-factors in 5-regular graphs. 239-261 - Lior Gishboliner
, Michael Krivelevich, Peleg Michaeli
:
Discrepancies of spanning trees and Hamilton cycles. 262-291 - Chun-Hung Liu:
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three. 292-335 - Zdenek Dvorák
, Jakub Pekárek
:
Characterization of 4-critical triangle-free toroidal graphs. 336-369 - Stefan Glock, Benny Sudakov:
An average degree condition for independent transversals. 370-391 - Arnold Neumaier, Safet Penjic
:
A unified view of inequalities for distance-regular graphs, part I. 392-439
![](https://dblp.org/img/cog.dark.24x24.png)
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.