default search action
Journal of Combinatorial Theory, Series B, Volume 169
Volume 169, 2024
- Cai Heng Li, Cheryl E. Praeger
, Shu Jiao Song:
Locally finite vertex-rotary maps and coset graphs with finite valency and finite edge multiplicity. 1-44 - Ruoyu Wang:
On the difference of mean subtree orders under edge contraction. 45-62 - Simona Boyadzhiyska
On the use of senders for asymmetric tuples of cliques in Ramsey theory. 63-95 - Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez, Sebastian Siebertz
Discrepancy and sparsity. 96-133 - Barnabás Janzer, Oliver Janzer
On locally rainbow colourings. 134-149 - Alexander F. Sidorenko
Turán numbers of r-graphs on r + 1 vertices. 150-160 - Shaun M. Fallat
Spectral arbitrariness for trees fails spectacularly. 161-210 - Xiying Du
Linkages and removable paths avoiding vertices. 211-232 - Matthew Jenssen, Viresh Patel, Guus Regts:
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. 233-252 - Patrick Bennett, Ryan Cushman, Andrzej Dudek
The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right. 253-297 - Tom Kelly
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number. 298-337 - Andrea Freschi, Allan Lo
An oriented discrepancy version of Dirac's theorem. 338-351 - Jérémie Chalopin
Boundary rigidity of CAT(0) cube complexes. 352-366 - Patrick Chervet, Roland Grappe
A weak box-perfect graph theorem. 367-372 - Ming Chen, Jie Han, Guanghui Wang, Donglei Yang
H-factors in graphs with small independence number. 373-405 - Marko Orel
The automorphism group of a complementary prism. 406-429 - Lele Liu
Extremal spectral radius of nonregular graphs with prescribed maximum degree. 430-479 - Ting-Wei Chao, Hung-Hsun Hans Yu
Kruskal-Katona-type problems via the entropy method. 480-506 - Tom Kelly, Alp Müyesser, Alexey Pokrovskiy:
Optimal spread for spanning subgraphs of Dirac hypergraphs. 507-541 - László Lovász:
The matroid of a graphing. 542-560 - Louis Esperet, Ugo Giocanti, Clément Legrand-Duchesne
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem. 561-613
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-11-15 19:21 CET 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: