default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 109
Volume 109, November 2014
- Ken-ichi Kawarabayashi, Kenta Ozeki
:
Spanning closed walks and TSP in 3-connected planar graphs. 1-33 - Demetres Christofides, Jan Hladký, András Máthé:
Hamilton cycles in dense vertex-transitive graphs. 34-72 - Alexandr V. Kostochka, Matthew P. Yancey:
Ore's conjecture on color-critical graphs is almost true. 73-101 - Jaroslav Nesetril, Patrice Ossona de Mendez, Xuding Zhu:
Colouring edges with many colours in cycles. 102-119 - Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó:
What is Ramsey-equivalent to a clique? 120-133 - Michael Molloy, Bruce A. Reed:
Colouring graphs when the number of colours is almost the maximum degree. 134-195 - Hamed Hatami, James Hirst, Serguei Norine:
The inducibility of blow-up graphs. 196-212 - Andrzej Dudek, Troy Retter, Vojtech Rödl:
On generalized Ramsey numbers of Erdős and Rogers. 213-227 - Krzysztof Choromanski, Maria Chudnovsky, Paul D. Seymour:
Tournaments with near-linear transitive subsets. 228-249 - József Balogh, Hong Liu:
On the number of K4-saturating edges. 250-257
- Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
An entropy argument for counting matroids. 258-262
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-08 20:19 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:
