![](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 41 matches
- 1985
- Michael O. Albertson, Karen L. Collins:
Homomorphisms of 3-chromatic graphs. Discret. Math. 54(2): 127-132 (1985) - Peter Alles:
The dimension of sums of graphs. Discret. Math. 54(2): 229-233 (1985) - Richard P. Anstee, Uppaluri S. R. Murty:
Matrices with forbidden subconfigurations. Discret. Math. 54(1): 113-116 (1985) - Malvina Baica:
Some new combinatorial identities derived from units in algebraic number fields. Discret. Math. 54(2): 133-141 (1985) - Edward A. Bender, Nicholas C. Wormald:
The number of loopless planar maps. Discret. Math. 54(2): 235-237 (1985) - Albrecht Beutelspacher, Franco Eugeni:
On the type of partial t-spreads in finite projective spaces. Discret. Math. 54(3): 241-257 (1985) - Stefan A. Burr, Jaroslav Nesetril
, Vojtech Rödl:
On the use of senders in generalized ramsey theory for graphs. Discret. Math. 54(1): 1-13 (1985) - Charalambos A. Charalambides, A. Kyriakoussis:
An asymptotic formula for the exponential polynomials and a central limit theorem for their coefficients. Discret. Math. 54(3): 259-270 (1985) - Ourania Chryssaphinou:
On Touchard polynomials. Discret. Math. 54(2): 143-152 (1985) - G. F. Clements:
Antichains in the set of subsets of a multiset. Discret. Math. 54(3): 347 (1985) - Patricia Vanden Cruyce:
A finite graph which is locally a dodecahedron. Discret. Math. 54(3): 343-346 (1985) - Konrad Engel, Hans-Dietrich O. F. Gronau:
An intersection-union theorem for integer sequences. Discret. Math. 54(2): 153-159 (1985) - Bruce Hedman:
The maximum number of cliques in dense graphs. Discret. Math. 54(2): 161-166 (1985) - Irwin L. Jungreis:
Infinite Hamiltonian paths in Cayley digraphs. Discret. Math. 54(2): 167-180 (1985) - Meir Katchalski, Ted Lewis, Joseph Zaks:
Geometric permutations for convex sets. Discret. Math. 54(3): 271-284 (1985) - Matt Kaufmann, Saharon Shelah
:
On random models of finite power and monadic logic. Discret. Math. 54(3): 285-293 (1985) - Feng Keqin:
A problem on algebraic graph theory. Discret. Math. 54(1): 107-109 (1985) - Peter Kovács:
The minimal trivalent graphs with given smallest odd cycle. Discret. Math. 54(3): 295-299 (1985) - Marc J. Lipman:
Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups. Discret. Math. 54(1): 15-21 (1985) - Colin L. Mallows, Larry A. Shepp:
Enumerating pairs of permutations with the same up-down form. Discret. Math. 54(3): 301-311 (1985) - Bojan Mohar:
Akempic triangulations with 4 odd vertices. Discret. Math. 54(1): 23-29 (1985) - Walid Naji:
Reconnaissance des graphes de cordes. Discret. Math. 54(3): 329-337 (1985) - Jaroslav Nesetril
, Vojtech Rödl:
Two remarks on Ramsey's theorem. Discret. Math. 54(3): 339-341 (1985) - Péter P. Pálfy:
On the chromatic number of certain highly symmetric graphs. Discret. Math. 54(1): 31-37 (1985) - Jürgen Peemöller:
Necessary Conditions for Hamiltonian Split Graphs. Discret. Math. 54(1): 39-47 (1985) - Myriam Preissmann:
A class of strongly perfect graphs. Discret. Math. 54(1): 117-120 (1985) - Hans Jürgen Prömel, Bernd Voigt:
Canonizing Ramsey theorems for finite graphs and hypergraphs. Discret. Math. 54(1): 49-59 (1985) - Alain Quilliot:
A retraction problem in graph theory. Discret. Math. 54(1): 61-71 (1985) - S. B. Rao:
On regular and strongly-regular self-complementary graphs. Discret. Math. 54(1): 73-82 (1985) - Bruce A. Reed:
A note on the semi-strong perfect graph conjecture. Discret. Math. 54(1): 111-112 (1985)
skipping 11 more matches
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-27 08:06 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