![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
European Journal of Combinatorics, Volume 45
Volume 45, April 2015
- Yan-Quan Feng
, Cai Heng Li
, Jin-Xin Zhou
:
Symmetric cubic graphs with solvable automorphism groups. 1-11 - Wenying Gan, Dániel Korándi, Benny Sudakov:
Ks, t-saturated bipartite graphs. 12-20 - Lorenzo Traldi:
Binary matroids and local complementation. 21-40 - Gui Xian Liu, Zai Ping Lu:
On edge-transitive cubic graphs of square-free order. 41-46 - Maarten De Boeck
:
Small maximal partial t-spreads in PG(2t+1, q). 47-58 - Takahiro Matsushita:
Answers to some problems about graph coloring test graphs. 59-64 - Dror Bar-Natan
, Huan T. Vo
:
Proof of a conjecture of Kulakova et al. related to the s12 weight system. 65-70 - Karim A. Adiprasito
, Bruno Benedetti
:
Tight complexes in 3-space admit perfect discrete Morse functions. 71-84 - Christopher A. Francisco
, Jeffrey Mermin, Jay Schweig:
Catalan numbers, binary trees, and pointed pseudotriangulations. 85-96 - Karl Heuer
:
A sufficient condition for Hamiltonicity in locally finite graphs. 97-114 - Mark S. MacLean:
The local eigenvalues of a bipartite distance-regular graph. 115-123 - Rafal Kalinowski, Monika Pilsniak:
Distinguishing graphs by edge-colourings. 124-131 - M. Aghabali, Saieed Akbari
, Shmuel Friedland, Klas Markström, Zakeieh Tajfirouz:
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges. 132-144
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.