Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 38
Volume 38, May 2014
- Sebastian M. Cioaba
, Jack H. Koolen, Weiqiang Li:
Disconnecting strongly regular graphs. 1-11 - Peter Horák, Otokar Grosek:
A new approach towards the Golomb-Welch conjecture. 12-22 - Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Erratum to "Application of polynomial method to on-line list colouring of graphs" [European J. Combin. 33(2012) 872-883]. 23 - Steven D. Noble, Gordon F. Royle:
The Merino-Welsh conjecture holds for series-parallel graphs. 24-35 - Loïc Foissy:
Deformation of the Hopf algebra of plane posets. 36-60 - Alison Thomson, Sanming Zhou:
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes. 61-78 - Paul D. Seymour:
Proof of a conjecture of Bowlin and Brin on four-colouring triangulations. 79-82 - Daniela Kühn, Deryk Osthus, Timothy Townsend:
Fractional and integer matchings in uniform hypergraphs. 83-96 - Daniel Kotlar, Ran Ziv:
Large matchings in bipartite graphs have a rainbow matching. 97-101 - Alireza Abdollahi, Mojtaba Jazaeri:
Groups all of whose undirected Cayley graphs are integral. 102-109 - Yingqian Wang:
Entire (Δ+2)-colorability of plane graphs. 110-121 - Hidefumi Ohsugi:
Gorenstein cut polytopes. 122-129 - Aida Abiad, Cristina Dalfó, Miguel Angel Fiol:
Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231]. 130-132
a service of 
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-04-22 20:02 CEST 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:
