default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 122
Volume 122, January 2017
- Johannes Carmesin
, J. Pascal Gollin:
Canonical tree-decompositions of a graph that display its k-blocks. 1-20 - Dennis Clemens, Anita Liebenau:
A non-trivial upper bound on the threshold bias of the Oriented-cycle game. 21-54 - Jonas Hägglund, Arthur Hoffmann-Ostenhof:
Construction of permutation snarks. 55-67 - Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell:
Antistrong digraphs. 68-90 - Martin Merker:
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree. 91-108 - Dennis Clemens, Julia Ehrenmüller, Alexey Pokrovskiy:
On sets not belonging to algebras and rainbow matchings in graphs. 109-120 - Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager:
On the Corrádi-Hajnal theorem and a question of Dirac. 121-148 - Nancy Ann Neudauer, Daniel C. Slilaty:
Bounding and stabilizing realizations of biased graphs with a fixed group. 149-166 - Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong:
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs. 167-186 - Matt DeVos, Edita Rollová, Robert Sámal:
A new proof of Seymour's 6-flow theorem. 187-195 - Asaf Ferber, Michael Krivelevich, Benny Sudakov:
Counting and packing Hamilton cycles in dense graphs and oriented graphs. 196-220 - Primoz Potocnik, Pablo Spiga, Gabriel Verret:
Asymptotic enumeration of vertex-transitive graphs of fixed valency. 221-240 - John Maharry, Neil Robertson, Vaidy Sivaraman, Daniel C. Slilaty:
Flexibility of projective-planar embeddings. 241-300 - Ted Dobson, Pablo Spiga:
Cayley numbers with arbitrarily many distinct prime factors. 301-310 - Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. 311-352 - David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ordered Ramsey numbers. 353-383 - Alexey Pokrovskiy, Benny Sudakov:
Ramsey goodness of paths. 384-390 - Benny Sudakov, Jan Volec:
Properly colored and rainbow copies of graphs with few cherries. 391-416 - Adam Kabela, Tomás Kaiser:
10-tough chordal graphs are Hamiltonian. 417-427 - Dániel Marx, Paul D. Seymour, Paul Wollan:
Rooted grid minors. 428-437 - Wei Wang:
A simple arithmetic criterion for graphs being determined by their generalized spectra. 438-451 - Vincent Cohen-Addad, Michael Hebdige, Daniel Král', Zhentao Li, Esteban Salgado:
Steinberg's Conjecture is false. 452-456 - Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows II: Trees. 457-478 - Marcin Wrochna:
Square-free graphs are multiplicative. 479-507 - Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi:
Decomposing highly edge-connected graphs into paths of any given length. 508-542 - Wei Wang, Jianguo Qian, Zhidan Yan:
When does the list-coloring function of a graph equal its chromatic polynomial. 543-549 - James Cruickshank, Derek Kitson, Stephen C. Power:
The generic rigidity of triangulated spheres with blocks and holes. 550-577 - Simon Hampe:
The intersection ring of matroids. 578-614 - Carsten Thomassen:
The number of colorings of planar graphs with no separating triangles. 615-633 - Louis DeBiasio, Luke L. Nelsen:
Monochromatic cycle partitions of graphs with large minimum degree. 634-667 - Bartosz Walczak:
Minors and dimension. 668-689 - Patrick Bennett, Andrzej Dudek:
On the Ramsey-Turán number with small s-independence number. 690-718 - Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis:
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. 719-740 - Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. 741-756 - Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. 757-775 - Gord Simons, Claude Tardif, David L. Wehlau:
Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers. 776-793 - Xuding Zhu:
Multiple list colouring of planar graphs. 794-799 - John Engbers, David J. Galvin:
Extremal H-colorings of trees and 2-connected graphs. 800-814 - Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant vertices for the planar Disjoint Paths Problem. 815-843 - Guus Regts, Bart Sevenster:
Graph parameters from symplectic group invariants. 844-868 - Peter Frankl:
A stability result for the Katona theorem. 869-876 - Christian Avart, Bill Kay, Christian Reiher, Vojtech Rödl:
The chromatic number of finite type-graphs. 877-896 - David Solymosi, József Solymosi:
Small cores in 3-uniform hypergraphs. 897-910
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-09-17 00:02 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:
