![](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 26 matches
- 1998
- Toma Albu:
Classes of lattices (co)generated by a lattice and their global (dual) Krull dimension. Discret. Math. 185(1-3): 1-18 (1998) - Jørgen Bang-Jensen
, Jing Huang:
Kings in quasi-transitive digraphs. Discret. Math. 185(1-3): 19-27 (1998) - Daniel K. Biss:
A lower bound on the number of functions satisfying the strict avalanche criterion. Discret. Math. 185(1-3): 29-39 (1998) - Hajo Broersma
, Huib Trommel:
Closure concepts for claw-free graphs. Discret. Math. 185(1-3): 231-238 (1998) - Krzysztof Brys, Zbigniew Lonc
:
Clique and anticlique partitions of graphs. Discret. Math. 185(1-3): 41-49 (1998) - D. de Caen:
An upper bound on the sum of squares of degrees in a graph. Discret. Math. 185(1-3): 245-248 (1998) - Beifang Chen, Sanming Zhou:
Upper bounds for f-domination number of graphs, . Discret. Math. 185(1-3): 239-243 (1998) - B. Corbas, Graham D. Williams:
Matrix representatives for three-dimensional bilinear forms over finite fields. Discret. Math. 185(1-3): 51-61 (1998) - Nancy Eaton:
Ramsey numbers for sparse graphs. Discret. Math. 185(1-3): 63-75 (1998) - Mohamed H. El-Zahar, Lobna A. Fateen:
On sphere orders. Discret. Math. 185(1-3): 249-253 (1998) - Johannes H. Hattingh, Michael A. Henning:
Star-path bipartite Ramsey numbers, . Discret. Math. 185(1-3): 255-258 (1998) - Sandi Klavzar:
On the fractional chromatic number and the lexicographic product of graphs. Discret. Math. 185(1-3): 259-263 (1998) - Martin Klazar:
On numbers of Davenport-Schinzel sequences. Discret. Math. 185(1-3): 77-87 (1998) - Xinrong Ma:
Nonexistence of extremal doubly even self-dual codes with large length. Discret. Math. 185(1-3): 265-274 (1998) - Thomas Niessen, Bert Randerath:
Regular factors of simple regular graphs and factor-spectra. Discret. Math. 185(1-3): 89-103 (1998) - Artem V. Pyatkin
:
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3. Discret. Math. 185(1-3): 275-278 (1998) - Gordon F. Royle
:
An orderly algorithm and some applications in finite geometry. Discret. Math. 185(1-3): 105-115 (1998) - Mateja Sajna:
Half-transitivity of some metacirculants. Discret. Math. 185(1-3): 117-136 (1998) - Attila Sali, Gábor Simonyi:
Intersecting set systems and graphic matroids, . Discret. Math. 185(1-3): 279-285 (1998) - Norbert Sauer:
Edge partitions of the countable triangle free homogeneous graph. Discret. Math. 185(1-3): 137-181 (1998) - Stanley M. Selkow:
The enumeration of labeled graphs by number of cutpoints. Discret. Math. 185(1-3): 183-191 (1998) - Saul Stahl:
The multichromatic numbers of some Kneser graphs. Discret. Math. 185(1-3): 287-291 (1998) - Claude Tardif:
Graph products and the chromatic difference sequence of vertex-transitive graphs. Discret. Math. 185(1-3): 193-200 (1998) - Jianxing Yin:
Some combinatorial constructions for optical orthogonal codes. Discret. Math. 185(1-3): 201-219 (1998) - Raphael Yuster:
Linear coloring of graphs. Discret. Math. 185(1-3): 293-297 (1998) - Sanming Zhou:
Interpolation theorems for graphs, hypergraphs and matroids. Discret. Math. 185(1-3): 221-229 (1998)
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-07-04 17:36 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