default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 158
Volume 158, Number Part 1, January 2023
- Michael Krivelevich, Bojan Mohar:
Robin Thomas (1962-2020). 1-2 - Noga Alon, Colin Defant, Noah Kravitz:
Typical and extremal aspects of friends-and-strangers graphs. 3-42 - Onur Çagirici, Petr Hlinený
, Filip Pokrývka, Abhisekh Sankaran:
Clique-width of point configurations. 43-73 - Zdenek Dvorák, Ken-ichi Kawarabayashi:
Additive non-approximability of chromatic number in proper minor-closed classes. 74-92 - Jim Geelen, O-joung Kwon, Rose McCarty, Paul Wollan:
The Grid Theorem for vertex-minors. 93-116 - Andrzej Grzesik, Daniel Král', László Miklós Lovász, Jan Volec:
Cycles of a given length in tournaments. 117-145 - Koyo Hayashi, Ken-ichi Kawarabayashi:
Rooted topological minors on four vertices. 146-185 - Yiting Jiang, Jaroslav Nesetril, Patrice Ossona de Mendez:
From χ- to χp-bounded classes. 186-209 - Chun-Hung Liu, Irene Muzi:
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation. 210-251 - Chun-Hung Liu:
Immersion and clustered coloring. 252-282 - Sergey Norin, Luke Postle:
Connectivity and choosability of graphs with no Kt minor. 283-300 - Carsten Thomassen:
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles. 301-312 - Michael C. Wigal, Xingxing Yu:
Tutte paths and long cycles in circuit graphs. 313-330
Volume 158, Number Part 2, January 2023
- David Conlon, Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
A new bound for the Brown-Erdős-Sós problem. 1-35 - Xizhi Liu, Dhruv Mubayi, Christian Reiher:
A unified approach to hypergraph stability. 36-62 - Alvaro Carbonero, Patrick Hompe, Benjamin R. Moore, Sophie Spirkl:
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number. 63-69 - Michael C. Wigal, Youngho Yoo, Xingxing Yu:
Approximating TSP walks in subcubic graphs. 70-104 - Xizhi Liu, Dhruv Mubayi, Christian Reiher:
The feasible region of induced graphs. 105-135 - Felix Joos, Marcus Kühn, Bjarne Schülke:
Decomposing hypergraphs into cycle factors. 136-175 - Michael Giudici, Luke Morgan, Jin-Xin Zhou:
On primitive 2-closed permutation groups of rank at most four. 176-205 - Thomas W. Tucker, Jin-Xin Zhou:
Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn. 206-225 - Luca Ghidelli:
On the largest planar graphs with everywhere positive combinatorial curvature. 226-263 - Ramin Javadi, Meysam Miralaei:
The multicolor size-Ramsey numbers of cycles. 264-285 - Guantao Chen, Yanli Hao:
On the coequal values of total chromatic number and chromatic index. 286-304 - Nemanja Draganic, David Munhá Correia, Benny Sudakov:
Tight bounds for powers of Hamilton cycles in tournaments. 305-340 - Eun-Kyung Cho, Jinha Kim, Minki Kim, Sang-il Oum:
Independent domination of graphs with bounded maximum degree. 341-352
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-29 00:16 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.
