default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 112
Volume 112, May 2015
- Eli Berger, Krzysztof Choromanski, Maria Chudnovsky
:
Forcing large transitive subtournaments. 1-17 - József Balogh, Hong Liu, Maryam Sharifzadeh:
Subdivisions of a large clique in C6-free graphs. 18-35 - Ken-ichi Kawarabayashi, Kenta Ozeki:
4-connected projective-planar graphs are Hamiltonian-connected. 36-69 - Jim Geelen, Peter Nelson:
A density Hales-Jewett theorem for matroids. 70-77 - Bojan Mohar:
Median eigenvalues and the HOMO-LUMO index of graphs. 78-92 - Xuding Zhu:
Circular flow number of highly edge connected signed graphs. 93-103 - Jim Geelen, Stefan H. M. van Zwam:
Matroid 3-connectivity and branch width. 104-123 - Song-Tao Guo, Yan-Quan Feng, Cai Heng Li:
Edge-primitive tetravalent graphs. 124-137 - Ilhee Kim, Paul D. Seymour:
Tournament minors. 138-153 - Jim Geelen, Rohan Kapadia:
Representability of matroids with a large projective geometry minor. 154-161
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:33 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:
