default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 48
Volume 48, August 2015
- Patrice Ossona de Mendez
, Pierre Rosenstiehl:
Foreword. 1 - Jaroslav Nesetril, Marco Pellegrini:
Preface. 2-4 - Wojciech Samotij:
Counting independent sets in graphs. 5-18 - Tom Sanders:
A statistical approach to covering lemmas. 19-33 - Michael Schubert, Eckhard Steffen:
Nowhere-zero flows on signed regular graphs. 34-47 - Clemens Huemer, Anna de Mier:
Lower bounds on the maximum number of non-crossing acyclic graphs. 48-62 - Martin Derka, Petr Hlinený:
Planar emulators conjecture is nearly true for cubic graphs. 63-70 - Lorenzo Luperi Baglini:
A nonstandard technique in combinatorial number theory. 71-80 - Vladimir Shenmaier:
Complexity and approximation of the Smallest k-Enclosing Ball problem. 81-87 - Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Rudini Menezes Sampaio, Ana Silva:
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. 88-99 - L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and cubicity of product graphs. 100-109 - Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad:
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. 110-126 - Marcin Gasiorek, Daniel Simson, Katarzyna Zajac:
On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams. 127-142 - Mirjam Friesen, Aya Hamed, Troy Lee, Dirk Oliver Theis:
Fooling-sets and rank. 143-153 - Victor A. Campos, Carlos Vinícius G. C. Lima, Ana Silva:
Graphs of girth at least 7 have high b-chromatic number. 154-164 - Guilherme Oliveira Mota, Gábor N. Sárközy, Mathias Schacht, Anusch Taraz:
Ramsey numbers for bipartite graphs with small bandwidth. 165-176 - Norbert Bogya, Gábor Korchmáros, Gábor Péter Nagy:
Classification of k-nets. 177-185 - Elie de Panafieu, Vlady Ravelomanana:
Analytic description of the phase transition of inhomogeneous multigraphs. 186-197 - Tobias Müller, Pawel Pralat:
The acquaintance time of (percolated) random geometric graphs. 198-214 - Raúl M. Falcón:
Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method. 215-223 - Zoltán Füredi, Dániel Gerbner, Máté Vizer:
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. 224-233
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-12-09 23:42 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:
