default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 173
Volume 173, 2025
- Soma Villányi:
Every d(d + 1)-connected graph is globally rigid in Rd. 1-13 - Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy
, Benny Sudakov:
Ascending subgraph decomposition. 14-44 - Zdenek Dvorák:
Clustered coloring of (path + 2K1)-free graphs on surfaces. 45-67 - Tung Nguyen, Alex D. Scott, Paul D. Seymour:
A counterexample to the coarse Menger conjecture. 68-82 - Matthias Hamann:
Tree amalgamations and quasi-isometries. 83-101 - Richard Montgomery, Matías Pavez-Signé, Jun Yan:
Ramsey numbers of bounded degree trees versus general graphs. 102-145 - Tung Nguyen, Alex Scott, Paul D. Seymour:
Some results and problems on tournament structure. 146-183 - Édouard Bonnet:
Sparse induced subgraphs of large treewidth. 184-203 - João Paulo Costalonga:
A splitter theorem on 3-connected binary matroids and inner fans. 204-245 - Rutger Campbell, Jochen Pascal Gollin, Kevin Hendrey, Raphael Steiner:
Optimal bounds for zero-sum cycles. I. Odd order. 246-256 - James Davies:
Pivot-minors and the Erdős-Hajnal conjecture. 257-278 - Joy Morris, Pablo Spiga:
Haar graphical representations of finite groups and an application to poset representations. 279-304 - Xiying Du, António Girão, Zach Hunter, Rose McCarty, Alex D. Scott:
Induced C4-free subgraphs with large average degree. 305-328
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-12 22:59 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.
