Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 43 matches
- 2016
- Ron Aharoni, C. J. Argue:
Covers in partitioned intersecting hypergraphs. Eur. J. Comb. 51: 222-226 (2016) - Jernej Azarija, Sandi Klavzar, Jaehun Lee, Jay Pantone, Yoomi Rho:
On isomorphism classes of generalized Fibonacci cubes. Eur. J. Comb. 51: 372-379 (2016) - Bhaskar Bagchi:
The mu vector, Morse inequalities and a generalized lower bound theorem for locally tame combinatorial manifolds. Eur. J. Comb. 51: 69-83 (2016) - Vladimir M. Blinovsky, Catherine S. Greenhill:
Asymptotic enumeration of sparse uniform hypergraphs with given degrees. Eur. J. Comb. 51: 287-296 (2016) - Miklós Bóna, István Mezö:
Real zeros and partitions without singleton blocks. Eur. J. Comb. 51: 500-510 (2016) - Michael Braun, Michael Kiermaier, Anamari Nakic:
On the automorphism group of a binary q-analog of the Fano plane. Eur. J. Comb. 51: 443-457 (2016) - Carl Johan Casselgren, Anders Sune Pedersen:
Hadwiger's Conjecture for inflations of 3-chromatic graphs. Eur. J. Comb. 51: 99-108 (2016) - Cesar Ceballos, Vincent Pilaud:
The diameter of type D associahedra and the non-leaving-face property. Eur. J. Comb. 51: 109-124 (2016) - Émilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni:
Abelian bordered factors and periodicity. Eur. J. Comb. 51: 407-418 (2016) - Haimiao Chen, Jin Ho Kwak:
Lifting graph automorphisms along solvable regular covers. Eur. J. Comb. 51: 519-532 (2016) - Xiang-Yu Dai, Jian-Hua Yin:
A complete characterization of graphic sequences with a Z3-connected realization. Eur. J. Comb. 51: 215-221 (2016) - Adrian W. Dudek:
Corrigendum to "Almost-Ramanujan graphs and prime gaps" [European J. Combin. 43 (2015) 204-209]. Eur. J. Comb. 51: 553-534 (2016) - Richard Ehrenborg, N. Bradley Fox:
The descent set polynomial revisited. Eur. J. Comb. 51: 47-68 (2016) - Louis Esperet:
Boxicity and topological invariants. Eur. J. Comb. 51: 495-499 (2016) - Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl:
A note on supersaturated set systems. Eur. J. Comb. 51: 190-199 (2016) - Peter Frankl, Norihide Tokushige:
Uniform eventown problems. Eur. J. Comb. 51: 280-286 (2016) - Stavros Garoufalidis, Sergey Norin, Thao Vuong:
Flag algebras and the stable coefficients of the Jones polynomial. Eur. J. Comb. 51: 165-189 (2016) - Jaroslaw Grytczuk, Karol Kosinski, Michal Zmarz:
Nonrepetitive colorings of line arrangements. Eur. J. Comb. 51: 275-279 (2016) - Bertrand Guenin, Irene Pivotto, Paul Wollan:
Displaying blocking pairs in signed graphs. Eur. J. Comb. 51: 135-164 (2016) - Karen Gunderson, Natasha Morrison, Jason Semeraro:
Bounding the number of hyperedges in friendship r-hypergraphs. Eur. J. Comb. 51: 125-134 (2016) - Thomas Y. He, Kathy Q. Ji, Wenston J. T. Zang:
Bilateral truncated Jacobi's identity. Eur. J. Comb. 51: 255-267 (2016) - Dan Hefetz, Michael Krivelevich, Alon Naor, Milos Stojakovic:
On saturation games. Eur. J. Comb. 51: 315-335 (2016) - Gaurush Hiranandani, Jean-Marc Schlenker:
Small circulant complex Hadamard matrices of Butson type. Eur. J. Comb. 51: 306-314 (2016) - Mitsugu Hirasaka, Kijung Kim, Hyonju Yu:
Isomorphism classes of association schemes induced by Hadamard matrices. Eur. J. Comb. 51: 37-46 (2016) - Kan Hu, Gareth A. Jones, Roman Nedela, Na-Er Wang:
Non-abelian almost totally branched coverings over the platonic maps. Eur. J. Comb. 51: 1-11 (2016) - Shenwei Huang:
Improved complexity results on k-coloring Pt-free graphs. Eur. J. Comb. 51: 336-346 (2016) - Seonghyuk Im, Hwidong Kim, Jiho Maeng, Jihwan Yu, Yongwook Cha, Seong-Hun Paeng:
On the mean square displacement of a random walk on a graph. Eur. J. Comb. 51: 227-235 (2016) - Matthieu Josuat-Vergès, Jang Soo Kim:
Generalized Dyck tilings. Eur. J. Comb. 51: 458-474 (2016) - Hal A. Kierstead, David A. Smith, William T. Trotter:
First-fit coloring on interval graphs has performance ratio at least 5. Eur. J. Comb. 51: 236-254 (2016) - Alexandr V. Kostochka, Xiaodong Li, Watcharintorn Ruksasakchai, Michael Santana, Tao Wang, G. Yu:
Strong chromatic index of subcubic planar multigraphs. Eur. J. Comb. 51: 380-397 (2016)
skipping 13 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-03 03:29 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint