Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 116
Volume 116, January 2016
- Johannes Carmesin
, Reinhard Diestel, M. Hamann, Fabian Hundertmark:
Canonical tree-decompositions of finite graphs I. Existence and algorithms. 1-24 - Elad Aigner-Horev, Reinhard Diestel, Luke Postle:
The structure of 2-separations of infinite matroids. 25-56 - Pu Gao, Cristiane M. Sato:
A transition of limiting distributions of large matchings in random graphs. 57-86 - Sergei V. Konyagin, Florian Luca, Bernard Mans, Luke Mathieson, Min Sha, Igor E. Shparlinski:
Functional graphs of polynomials over finite fields. 87-122 - Jan Hladký, Diana Piguet:
Loebl-Komlós-Sós Conjecture: Dense case. 123-190 - Asaf Shapira, Raphael Yuster:
Unavoidable tournaments. 191-207 - Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour:
Immersion in four-edge-connected graphs. 208-218 - Maria Chudnovsky, Gil Kalai, Eran Nevo, Isabella Novik, Paul D. Seymour:
Bipartite minors. 219-228 - Paul D. Seymour:
Tree-chromatic number. 229-237 - Jim Geelen, Peter Nelson:
The critical number of dense triangle-free binary matroids. 238-249 - Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are there any good digraph width measures? 250-286 - Zdenek Dvorák, Ken-ichi Kawarabayashi, Daniel Král':
Packing six T-joins in plane graphs. 287-305 - Endre Csóka:
On the graph limit question of Vera T. Sós. 306-311 - Jakub Kozik, Dmitry A. Shabanov:
Improved algorithms for colorings of simple hypergraphs and applications. 312-332 - Imdadullah Khan:
Perfect matchings in 4-uniform hypergraphs. 333-366 - Amin Coja-Oghlan, Charilaos Efthymiou, Samuel Hetterich:
On the chromatic number of random regular graphs. 367-439 - Marina Arav, Frank J. Hall, Zhongshan Li, Hein van der Holst:
Signed graphs whose signed Colin de Verdière parameter is two. 440-455 - Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon:
Perfect graphs of arbitrarily large clique-chromatic number. 456-464 - Andrew Suk:
Semi-algebraic Ramsey numbers. 465-483 - Masanori Sawa:
On a symmetric representation of Hermitian matrices and its applications to graph theory. 484-503 - Jin-Xin Zhou, Yan-Quan Feng:
The automorphisms of bi-Cayley graphs. 504-532
a service of 
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-05-13 20:15 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
