default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 113
Volume 113, July 2015
- Tomás Kaiser
, Matej Stehlík:
Colouring quadrangulations of projective spaces. 1-17 - Ken-ichi Kawarabayashi, Jie Ma, Xingxing Yu:
Subdivisions of K5 in graphs containing K2, 3. 18-67 - Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill:
On the chromatic number of a random hypergraph. 68-122 - Shin-ichi Tanigawa:
Sufficient conditions for the global rigidity of graphs. 123-140 - Hsien-Chih Chang, Hsueh-I Lu:
A faster algorithm to recognize even-hole-free graphs. 141-161 - Huda Chuangpishit, Mahya Ghandehari, Matthew Hurshman, Jeannette C. M. Janssen, Nauzer Kalyaniwalla:
Linear embeddings of graphs and graph limits. 162-184 - Jim Geelen, Peter Nelson:
Projective geometries in exponentially dense matroids. I. 185-207 - Peter Nelson:
Projective geometries in exponentially dense matroids. II. 208-219 - Noga Alon:
Bipartite decomposition of random graphs. 220-235 - Béla Bollobás, Oliver Riordan:
An old approach to the giant component problem. 236-260
- Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
The Erdős-Hajnal conjecture for paths and antipaths. 261-264
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 2025-01-04 01:01 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:
