default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 164
Volume 164, January 2024
- Anders Martinsson, Raphael Steiner
:
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs. 1-16
- Johannes Carmesin, Jan Kurkofka:
Entanglements. 17-28
- János Pach, Gábor Tardos, Géza Tóth:
Disjointness graphs of short polygonal chains. 29-43 - József Balogh, Ramon Garcia, Lina Li, Adam Zsolt Wagner:
Intersecting families of sets are typically trivial. 44-67 - Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Bipartite graphs with no K6 minor. 68-104 - Yiting Jiang, Jaroslav Nesetril:
Minimal asymmetric hypergraphs. 105-118 - Allan Lo, Viresh Patel, Mehmet Akif Yildiz:
Hamilton cycles in dense regular digraphs and oriented graphs. 119-160 - Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Excluding a planar matching minor in bipartite graphs. 161-221 - Nathan J. Bowler, Yared Nigussie:
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture. 222-244 - Bohdan Kivva:
On the automorphism groups of rank-4 primitive coherent configurations. 245-298 - Bojan Mohar, Petr Skoda:
Excluded minors for the Klein bottle I. Low connectivity case. 299-320 - Tung Nguyen, Alex D. Scott, Paul D. Seymour:
Induced paths in graphs without anticomplete cycles. 321-339 - Ada Chan, William J. Martin:
Quantum isomorphism of graphs from association schemes. 340-363
- Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne, Jonathan Narboni:
On a recolouring version of Hadwiger's conjecture. 364-370
- Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. 371-403 - Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus clique number. II. Tree-independence number. 404-442 - Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. 443-472 - Alex D. Scott, Paul D. Seymour:
Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph. 473-491 - Paul Knappe, Jan Kurkofka:
The immersion-minimal infinitely edge-connected graph. 492-516 - Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. 517-548
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-04 11:54 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.
