![](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 34 matches
- 1997
- Aaron Abrams:
The kth upper chromatic number of the line. Discret. Math. 169(1-3): 157-162 (1997) - Dragic Bankovic:
General reproductive solutions of Postian equations. Discret. Math. 169(1-3): 163-168 (1997) - Claude Berge, Jean-Luc Fouquet:
On the optimal transversals of the odd cycles. Discret. Math. 169(1-3): 169-175 (1997) - Oleg V. Borodin:
A new proof of Grünbaum's 3 color theorem. Discret. Math. 169(1-3): 177-183 (1997) - Iliya G. Bouyukliev:
New bounds for the minimum length of quaternary linear codes of dimension five. Discret. Math. 169(1-3): 185-192 (1997) - Gunnar Brinkmann, Eckhard Steffen
:
3- and 4-critical graphs of small even order. Discret. Math. 169(1-3): 193-197 (1997) - Andries E. Brouwer, Henry Martyn Mulder:
The vertex connectivity of a {0, 2}-graph equals its degree. Discret. Math. 169(1-3): 153-155 (1997) - Richard A. Brualdi, J. A. Dias da Silva:
A retract characterization of posets with the fixed-point property. Discret. Math. 169(1-3): 199-203 (1997) - D. de Caen:
A lower bound on the probability of a union. Discret. Math. 169(1-3): 217-220 (1997) - Mao-cheng Cai:
Connected [k, k + 1]-factors of graphs. Discret. Math. 169(1-3): 1-16 (1997) - Kathie Cameron:
Coloured matchings in bipartite graphs. Discret. Math. 169(1-3): 205-209 (1997) - Beifang Chen:
Parametric Möbius inversion formulas. Discret. Math. 169(1-3): 211-215 (1997) - G. F. Clements:
The cubical poset is additive. Discret. Math. 169(1-3): 17-28 (1997) - Karen L. Collins, Lucia B. Krompart:
The number of Hamiltonian paths in a rectangular grid. Discret. Math. 169(1-3): 29-38 (1997) - Feng Ming Dong
, Khee Meng Koh:
On graphs in which any pair of colour classes but one induces a tree. Discret. Math. 169(1-3): 39-54 (1997) - Tuvi Etzion:
Optimal constant weight codes over Zk and generalized designs. Discret. Math. 169(1-3): 55-82 (1997) - Hortensia Galeana-Sánchez:
A characterization of normal fraternally orientable perfect graphs. Discret. Math. 169(1-3): 221-225 (1997) - Xavier Gourdon, Helmut Prodinger:
A generating function approach to random subgraphs of the n-cycle. Discret. Math. 169(1-3): 227-232 (1997) - Jerrold R. Griggs, Yan-Chyuan Lin:
The maximum sum of degrees above a threshold in planar graphs. Discret. Math. 169(1-3): 233-243 (1997) - Jerrold W. Grossman:
Dominating sets whose closed stars form spanning trees. Discret. Math. 169(1-3): 83-94 (1997) - Vladimir Gurvich, Leonid Khachiyan:
On the frequency of the most frequently occurring variable in dual monotone DNFs. Discret. Math. 169(1-3): 245-248 (1997) - Vladimir P. Korzhik:
A tighter bounding interval for the 1-chromatic number of a surface. Discret. Math. 169(1-3): 95-120 (1997) - David Kuo, Gerard J. Chang, Y. H. Harris Kwong:
Cordial labeling of mKn. Discret. Math. 169(1-3): 121-131 (1997) - Xin Liu:
Lower bounds of length of longest cycles in graphs involving neighborhood unions. Discret. Math. 169(1-3): 133-144 (1997) - Xin Liu, B. Wei:
A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs. Discret. Math. 169(1-3): 249-255 (1997) - Anthony J. Macula:
Two applications of separating systems to nonadaptive procedures. Discret. Math. 169(1-3): 257-262 (1997) - Ken Ono:
Odd values of the partition function. Discret. Math. 169(1-3): 263-268 (1997) - Søren Riis
:
Bootstrapping the primitive recursive functions by only 27 colors. Discret. Math. 169(1-3): 269-272 (1997) - Sergey Vasil'evich Sevast'janov, Wojciech Banaszczyk
:
To the Steinitz lemma in coordinate form. Discret. Math. 169(1-3): 145-152 (1997) - Ladislav Stacho:
A sufficient condition guaranteeing large cycles in graphs. Discret. Math. 169(1-3): 273-277 (1997)
skipping 4 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-07-27 23:28 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