default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 63
Volume 63, June 2017
- Dongryul Kim:
Nonexistence of perfect 2-error-correcting Lee codes in certain dimensions. 1-5 - Catherine S. Greenhill, Mikhail Isaev
, Matthew Kwan, Brendan D. McKay:
The average number of spanning trees in sparse graphs with given degrees. 6-25 - Dan Hefetz, Michael Krivelevich, Wei En Tan:
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. 26-43 - Jianfeng Hou, Shufei Wu, Guiying Yan:
On bisections of directed graphs. 44-58 - Carolyn Chun, Deborah Chun, Steven D. Noble:
Inductive tools for connected delta-matroids and multimatroids. 59-69 - Cheng Yeaw Ku, Terry Lau, Kok Bin Wong:
On the partition associated to the smallest eigenvalues of the k-point fixing graph. 70-94 - Anton Bernshteyn:
The Local Cut Lemma. 95-114 - Tilen Marc:
Mirror graphs: Graph theoretical characterization of reflection arrangements and finite Coxeter groups. 115-123 - Ewan Davies, Matthew Jenssen, Barnaby Roberts:
Multicolour Ramsey numbers of paths and even cycles. 124-133 - Jia-Li Du, Yan-Quan Feng, Jin-Xin Zhou:
Pentavalent symmetric graphs admitting vertex-transitive non-abelian simple groups. 134-145 - Gill Barequet, Mira Shalah:
Counting n-cell polycubes proper in n-k dimensions. 146-163 - Sophie Huczynska, Nikola Ruskuc:
On well quasi-order of graph classes under homomorphic image orderings. 164-175 - Justine Louis:
Asymptotics for the determinant of the combinatorial Laplacian on hypercubic lattices. 176-196 - Lowell Abrams:
Families of fixed-point cellular rotations. 197-215 - Takahiro Matsushita:
Homotopy types of the Hom complexes of graphs. 216-226
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-01 23:10 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:
