![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 31 matches
- 1986
- Kenneth A. Berman:
Parity results on connected f-factors. Discret. Math. 59(1-2): 1-8 (1986) - Albrecht Beutelspacher, Inge Schestag:
Finite linear spaces in which any n-gon is euclidean. Discret. Math. 59(3): 207-220 (1986) - Arie Bialostocki, Norbert Sauer:
On Ramsey-Turán type problems in tournaments. Discret. Math. 59(3): 221-228 (1986) - Andries E. Brouwer:
An inequality in binary vector spaces. Discret. Math. 59(3): 315-317 (1986) - Mauro Cerasoli:
Enumeration with the lattice of periods. Discret. Math. 59(1-2): 191-198 (1986) - James R. Clay:
More balanced incomplete block designs from frobenius groups. Discret. Math. 59(3): 229-234 (1986) - Wayne M. Dymàcek:
Bipartite Steinhaus graphs. Discret. Math. 59(1-2): 9-20 (1986) - Paul Erdös, Marcel Erné:
Clique numbers of graphs. Discret. Math. 59(3): 235-242 (1986) - Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress:
Coloring graphs with locally few colors. Discret. Math. 59(1-2): 21-34 (1986) - Alan M. Frieze
:
On large matchings and cycles in sparse random graphs. Discret. Math. 59(3): 243-256 (1986) - Hortensia Galeana-Sánchez:
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs. Discret. Math. 59(1-2): 35-41 (1986) - Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On kernel-perfect critical digraphs. Discret. Math. 59(3): 257-265 (1986) - David G. Glynn:
The non-classical 10-arc of PG(4, 9). Discret. Math. 59(1-2): 43-51 (1986) - David A. Gregory, Sean McGuinness, Walter D. Wallis:
Clique partitions of the cocktail party graph. Discret. Math. 59(3): 267-273 (1986) - Michael Hager:
Path-connectivity in graphs. Discret. Math. 59(1-2): 53-59 (1986) - András Hajnal, Norbert Sauer:
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. Discret. Math. 59(1-2): 61-67 (1986) - Alan Hartman
:
On small packing and covering designs with block size 4. Discret. Math. 59(3): 275-281 (1986) - Katherine Heinrich, Lie Zhu:
Existence of orthogonal latin squares with aligned subsquares. Discret. Math. 59(1-2): 69-78 (1986) - Alain Hertz:
Quelques utilisations de la struction. Discret. Math. 59(1-2): 79-89 (1986) - W. Cary Huffman:
On automorphism groups of certain 2-(v, 3, 2) designs induced by group actions. Discret. Math. 59(3): 283-296 (1986) - Vikram Jha, Norman L. Johnson:
Regular parallelisms from translation planes. Discret. Math. 59(1-2): 91-97 (1986) - Bernhard Korte, László Lovász:
Non-interval greedoids and the transposition property. Discret. Math. 59(3): 297-314 (1986) - Bernt Lindström:
A non-linear algebraic matroid with infinite characteristic set. Discret. Math. 59(3): 319-320 (1986) - R. P. Nederpelt:
Bijections between formulae and trees which are compatible with equivalences of the type ((f·g)·h)~((f·h)·g). Discret. Math. 59(1-2): 99-105 (1986) - P. J. Owens:
Simple 3-polytopal graphs with edges of only two types and shortness coefficients. Discret. Math. 59(1-2): 107-114 (1986) - D. Piollet:
Solutions d'une equation quadratique dans le groupe libre. Discret. Math. 59(1-2): 115-123 (1986) - Vojtech Rödl:
On universality of graphs with uniformly distributed edges. Discret. Math. 59(1-2): 125-134 (1986) - Michael E. Saks:
Some sequences associated with combinatorial structures. Discret. Math. 59(1-2): 135-166 (1986) - A. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham:
Extension of a clique cover result to uniform hypergraphs. Discret. Math. 59(1-2): 199-201 (1986) - Yongbing Shi:
Some theorems of uniquely pancyclic graphs. Discret. Math. 59(1-2): 167-180 (1986)
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-23 08:13 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