


default search action
Journal of Combinatorial Theory, Series B, Volume 111
Volume 111, March 2015
- Nathan J. Bowler, Johannes Carmesin

, Julian Pott:
Edge-disjoint double rays in infinite graphs: A Halin type result. 1-16 - Barnaby Martin

, Daniël Paulusma
:
The computational complexity of disconnected cut and 2K2-partition. 17-37 - Alexander Leaf, Paul D. Seymour

:
Tree-width and planar minors. 38-53 - Wenqin Xu

, Shao-Fei Du, Jin Ho Kwak, Ming Yao Xu:
2-Arc-transitive metacyclic covers of complete graphs. 54-74 - Jacob Fox, Andrey Grinshpun, János Pach:

The Erdős-Hajnal conjecture for rainbow triangles. 75-125 - Rudi Pendavingh, Jorn G. van der Pol:

Counting matroids in minor-closed classes. 126-147 - Primoz Potocnik, Pablo Spiga, Gabriel Verret:

Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs. 148-180 - Feng Ming Dong

:
On zero-free intervals of flow polynomials. 181-200 - William B. Kinnersley:

Cops and Robbers is EXPTIME-complete. 201-220 - Yared Nigussie:

Finite structure for Friedman ideals of finite trees. 221-233 - Luke Postle, Robin Thomas:

Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. 234-241
- Guy Moshkovitz

, Asaf Shapira
:
Exact bounds for some hypergraph saturation problems. 242-248 - Justin Salez

:
Every totally real algebraic integer is a tree eigenvalue. 249-256

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














