Остановите войну!
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 53 matches
- 2014
- Marién Abreu, Domenico Labbate, Romeo Rizzi, John Sheehan:
Odd 2-factored snarks. Eur. J. Comb. 36: 460-472 (2014) - Hans Adler, Isolde Adler:
Interpreting nowhere dense graph classes as a classical notion of model theory. Eur. J. Comb. 36: 322-330 (2014) - Rémi Cocou Avohou, Joseph Ben Geloun, Etera R. Livine:
On terminal forms for topological polynomials for ribbon graphs: The NN-petal flower. Eur. J. Comb. 36: 348-366 (2014) - Bhaskar Bagchi, Basudeb Datta:
On stellated spheres and a tightness criterion for combinatorial manifolds. Eur. J. Comb. 36: 294-313 (2014) - Sejeong Bang, Jacobus H. Koolen:
On geometric distance-regular graphs with diameter three. Eur. J. Comb. 36: 331-341 (2014) - Georgia Benkart, Tom Halverson:
Motzkin algebras. Eur. J. Comb. 36: 473-502 (2014) - Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Short proofs of coloring theorems on planar graphs. Eur. J. Comb. 36: 314-321 (2014) - Henning Bruhn, Maya Stein:
Minimal bricks have many vertices of small degree. Eur. J. Comb. 36: 261-269 (2014) - Beifang Chen:
Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of Tutte polynomial at positive integers. Eur. J. Comb. 36: 206-230 (2014) - William Y. C. Chen, Alvin Y. L. Dai, Robin D. P. Zhou:
Ordered partitions avoiding a permutation pattern of length 3. Eur. J. Comb. 36: 416-424 (2014) - Yichao Chen, Jonathan L. Gross, Xiaodong Hu:
Enumeration of digraph embeddings. Eur. J. Comb. 36: 660-678 (2014) - Lily Chen, Xueliang Li, Mengmeng Liu:
The (revised) Szeged index and the Wiener index of a nonbipartite graph. Eur. J. Comb. 36: 237-246 (2014) - William Y. C. Chen, Janet F. F. Peng:
Disposition polynomials and plane trees. Eur. J. Comb. 36: 122-129 (2014) - Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids II. Eur. J. Comb. 36: 550-563 (2014) - Louis DeBiasio, Tao Jiang:
On the co-degree threshold for the Fano plane. Eur. J. Comb. 36: 151-158 (2014) - Michael Dorfling, Michael A. Henning:
Linear hypergraphs with large transversal number and maximum degree two. Eur. J. Comb. 36: 231-236 (2014) - Shao-Fei Du, Jun-Yang Zhang:
A classification of orientably-regular embeddings of complete multipartite graphs. Eur. J. Comb. 36: 437-452 (2014) - Zdenek Dvorák, Louis Esperet:
Distance-two coloring of sparse graphs. Eur. J. Comb. 36: 406-415 (2014) - Askar Dzhumadil'daev, Damir Yeliussizov:
Stirling permutations on multisets. Eur. J. Comb. 36: 377-392 (2014) - Konrad Engel, Tadeusz Radzik, Jan-Christoph Schlage-Puchta:
Optimal integer partitions. Eur. J. Comb. 36: 425-436 (2014) - Sen-Peng Eu, Tung-Shan Fu, Yeh-Jong Pan:
A refined sign-balance of simsun permutations. Eur. J. Comb. 36: 97-109 (2014) - Tamar Friedmann, Richard P. Stanley:
Counting conjugacy classes of elements of finite order in Lie groups. Eur. J. Comb. 36: 86-96 (2014) - Giovanni Gaiffi, Matteo Serventi:
Families of building sets and regular wonderful models. Eur. J. Comb. 36: 17-38 (2014) - Agelos Georgakopoulos:
Characterising planar Cayley graphs and Cayley complexes in terms of group presentations. Eur. J. Comb. 36: 282-293 (2014) - Shi-Cai Gong, Guang-Hui Xu, Wen-Bing Zhong:
4-regular oriented graphs with optimum skew energies. Eur. J. Comb. 36: 77-85 (2014) - Afshin Goodarzi:
Convex hull of face vectors of colored complexes. Eur. J. Comb. 36: 247-250 (2014) - Simon Hampe:
a-tint: A polymake extension for algorithmic tropical intersection theory. Eur. J. Comb. 36: 579-607 (2014) - Stephen G. Hartke, Derrick Stolee:
A linear programming approach to the Manickam-Miklós-Singhi conjecture. Eur. J. Comb. 36: 53-70 (2014) - Peter Heinig:
On prisms, Möbius ladders and the cycle space of dense graphs. Eur. J. Comb. 36: 503-530 (2014) - Pavol Hell, Mark H. Siggers:
Semilattice polymorphisms and chordal graphs. Eur. J. Comb. 36: 694-706 (2014)
skipping 23 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-05-09 07:41 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