default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 146
Volume 146, January 2021
- David Pokrass Jacobs, Elismar R. Oliveira
, Vilmar Trevisan:
Most Laplacian eigenvalues of a tree are small. 1-33 - Jan Kurkofka, Max Pitz:
Tangles and the Stone-Čech compactification of infinite graphs. 34-60 - Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt:
The interval number of a planar graph is at most three. 61-67 - Martin Merker:
Gaps in the cycle spectrum of 3-connected cubic planar graphs. 68-75 - Binlong Li, Bo Ning:
A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture. 76-95 - Dániel Korándi, Richard Lang, Shoham Letzter, Alexey Pokrovskiy:
Minimum degree conditions for monochromatic cycle partitioning. 96-123 - Louis DeBiasio, András Gyárfás, Gábor N. Sárközy:
Ramsey numbers of path-matchings, covering designs, and 1-cores. 124-140 - Xuding Zhu:
Relatively small counterexamples to Hedetniemi's conjecture. 141-150 - Rohan Kapadia, Sergey Norin, Yingjie Qian:
Asymptotic density of graphs excluding disconnected minors. 151-175 - Viktória E. Kaszanitzky, Bernd Schulze, Shin-ichi Tanigawa:
Global rigidity of periodic graphs under fixed-lattice representations. 176-218 - Julia Chuzhoy, Zihan Tan:
Towards tight(er) bounds for the Excluded Grid Theorem. 219-265 - António Girão, Kamil Popielarz, Richard Snyder:
Subdivisions of digraphs in tournaments. 266-285 - Kevin Grace:
The templates for some classes of quaternary matroids. 286-363 - Simon Spacapan:
A counterexample to prism-hamiltonicity of 3-connected planar graphs. 364-371 - Soheil Azarpendar, Amir Jafari:
On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs. 372-381 - Michelle Delcourt, Luke Postle:
Progress towards Nash-Williams' conjecture on triangle decompositions. 382-416 - Michal Amir, Asaf Shapira, Mykhaylo Tyomkyn:
Two Erdős-Hajnal-type theorems in hypergraphs. 417-438 - Stefan Glock, Daniela Kühn, Richard Montgomery, Deryk Osthus:
Decompositions into isomorphic rainbow spanning trees. 439-484 - Xiaoyu He, Yuval Wigderson:
Hedetniemi's conjecture is asymptotically false. 485-494 - Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part IV: Induced paths and cycles. 495-531
- Brian Alspach, Heather Jordon:
Corrigendum to "Cycle decompositions of Kn and Kn - I" [J. Combin. Theory Ser. B 81 (1) (2001) 77-99]. 532-533
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 2025-03-04 21:14 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:
