Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 103
Volume 103, Number 1, January 2013
- Eli Berger, Krzysztof Choromanski, Maria Chudnovsky
, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
Tournaments and colouring. 1-20 - Bill Jackson, Aldo Procacci, Alan D. Sokal:
Complex zero-free regions at large |q| for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights. 21-45 - Jun Fujisawa, Atsuhiro Nakamoto, Kenta Ozeki:
Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. 46-60 - Gwenaël Joret, David R. Wood:
Complete graph minors and the graph minor structure theorem. 61-74 - Peter Nelson:
Growth rate functions of dense classes of representable matroids. 75-92 - Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Balázs Ráth, Rudini Menezes Sampaio:
Limits of permutation sequences. 93-113 - Colin McDiarmid, Tobias Müller:
Integer realizations of disk and segment graphs. 114-143 - Murilo Vicente Gonçalves da Silva, Kristina Vuskovic:
Decomposition of even-hole-free graphs with star cutsets and 2-joins. 144-183 - Lorenzo Traldi:
On the interlace polynomials. 184-208
Volume 103, Number 2, March 2013
- Gareth A. Jones:
Characterisations and Galois conjugacy of generalised Paley maps. 209-219 - Oleg Pikhurko:
Exact computation of the hypergraph Turán function for expanded complete 2-graphs. 220-225 - Béla Bollobás, Gábor Kun, Imre Leader:
Cops and robbers in a random graph. 226-236 - Robin Christian, R. Bruce Richter, Gelasio Salazar:
Zarankiewicz's Conjecture is finite for each fixed m. 237-247 - Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-cut gaps for integer and fractional multiflows. 248-273 - Thomas Andreae:
Classes of locally finite ubiquitous graphs. 274-290 - Daniela Kühn, Deryk Osthus, Andrew Treglown:
Matchings in 3-uniform hypergraphs. 291-305 - Mihyun Kang, Konstantinos Panagiotou:
On the connectivity of random graphs from addable classes. 306-312
Volume 103, Number 3, May 2013
- Ken-ichi Kawarabayashi, Kenta Ozeki:
A simpler proof for the two disjoint odd cycles theorem. 313-319 - Ken-ichi Kawarabayashi, Gexin Yu:
Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture. 320-326
- Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford:
Extremal graphs without 4-cycles. 327-336 - Noga Alon, Raphael Yuster:
The Turán number of sparse spanning graphs. 337-343 - Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov:
A problem of Erdős on the minimum number of k-cliques. 344-373 - Alexandra Ovetsky Fradkin, Paul D. Seymour:
Tournament pathwidth and topological containment. 374-384 - Ben Clark, Geoff Whittle:
Tangles, trees, and flowers. 385-407
Volume 103, Number 4, July 2013
- Guantao Chen, Songling Shan:
Homeomorphically irreducible spanning trees. 409-414 - Peter Frankl, Mitsuo Kato, Gyula O. H. Katona, Norihide Tokushige:
Two-colorings with many monochromatic cliques in both colors. 415-427 - Victor Chepoi, Mark F. Hagen:
On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes. 428-467 - Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström:
Generation and properties of snarks. 468-488 - James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young:
Monochromatic triangles in three-coloured graphs. 489-503 - Carsten Thomassen:
Decomposing a graph into bistars. 504-508 - Dion Gijswijt, Gyula Pap:
An algorithm for weighted fractional matroid matching. 509-520 - Andriy V. Bondarenko, Danylo V. Radchenko:
On a family of strongly regular graphs with λ=1λ=1. 521-531 - Jesper Lykke Jacobsen, Jesús Salas:
Is the five-flow conjecture almost false? 532-565
Volume 103, Number 5, September 2013
- Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Substitution and χ-boundedness. 567-586 - László Miklós Lovász, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang:
Nowhere-zero 3-flows and modulo k-orientations. 587-598 - Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Bisections of graphs. 599-629 - Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Detecting an induced net subdivision. 630-641 - Jim Geelen, Bert Gerards:
Characterizing graphic matroids by a system of linear equations. 642-646 - Peter Frankl:
On the number of nonnegative sums. 647-649
Volume 103, Number 6, November 2013
- Le Anh Vinh:
Graphs generated by Sidon sets and algebraic equations over finite fields. 651-657 - Enno Buß, Hiêp Hàn, Mathias Schacht:
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. 658-678 - Boris G. Pittel:
On z-analogue of Stepanov-Lomonosov-Polesskii inequality. 679-688 - Robert Connelly, Tibor Jordán, Walter Whiteley:
Generic global rigidity of body-bar frameworks. 689-705 - Arash Asadi, Zdenek Dvorák, Luke Postle, Robin Thomas:
Sub-exponentially many 3-colorings of triangle-free planar graphs. 706-712 - Jie Ma, Xingxing Yu:
K5-Subdivisions in graphs containing K-4. 713-732 - Jongyook Park, Jack H. Koolen, Greg Markowsky:
There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2/k and large diameter. 733-741 - Stephen G. Hartke, Tyler Seacrest:
Random partitions and edge-disjoint Hamiltonian cycles. 742-766 - Alan M. Frieze, Dhruv Mubayi:
Coloring simple hypergraphs. 767-794
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-04-16 20:19 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:
