Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 60
Volume 60, February 2017
- Raphael Yuster:
A Ramsey type result for oriented trees. 1-9 - Carolyn Chun
, Rhiannon Hall, Criel Merino, Steven D. Noble:
On zeros of the characteristic polynomial of matroids of bounded tree-width. 10-20 - Slawomir Solecki, Min Zhao:
A Ramsey theorem for partial orders with linear extensions. 21-30 - Shoni Gilboa, Dan Hefetz:
On degree anti-Ramsey numbers. 31-41 - Richard Lang, Maya Stein:
Local colourings and monochromatic partitions in complete bipartite graphs. 42-54 - Tomás Feder, Pavol Hell, César Hernández-Cruz:
Colourings, homomorphisms, and partitions of transitive digraphs. 55-65 - Maksim E. Zhukovskii:
On the zero-one k-law extensions. 66-81 - Asma Hamzeh, A. R. Ashrafi:
Automorphism groups of supergraphs of the power graph of a finite group. 82-88 - Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu:
Densities in large permutations and parameter testing. 89-99 - William Kuszmaul:
Signed enumeration of upper-right corners in path shuffles. 100-113 - Le Quang Ham, Thang Van Pham, Le Anh Vinh:
Conditional expanding bounds for two-variable functions over finite valuation rings. 114-123 - Julien Bensmail, Martin Merker, Carsten Thomassen:
Decomposing graphs into a constant number of locally irregular subgraphs. 124-134 - Johannes Carmesin:
Topological cycle matroids of infinite graphs. 135-150
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-25 04:43 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:
