default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 53
Volume 53, April 2016
- László Miklós Lovász
:
A short proof of the equivalence of left and right convergence for sparse graphs. 1-7 - Thomas Gobet, Nathan Williams:
Noncrossing partitions and Bruhat order. 8-34 - Qing-Hu Hou:
An insertion algorithm and leaders of rooted trees. 35-44 - James G. Oxley:
A matroid analogue of a theorem of Brooks for graphs. 45-49 - Boris Albar, Daniel Gonçalves, Jorge L. Ramírez Alfonsín:
Detecting minors in matroids through triangles. 50-58 - Woong Kook, Kang-Ju Lee:
A formula for simplicial tree-numbers of matroid complexes. 59-65 - Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Domination number and Laplacian eigenvalue distribution. 66-71 - Antonio Campello, Grasiele C. Jorge, João E. Strapasson, Sueli I. R. Costa:
Perfect codes in the lp metric. 72-85 - Susana-Clara López, Francesc A. Muntaner-Batle:
Langford sequences and a product of digraphs. 86-95 - Takayuki Okuda, Wei-Hsuan Yu:
A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4. 96-103
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-04 22:08 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:
