![](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
- 2000
- Maria Axenovich:
A generalized Ramsey problem. Discret. Math. 222(1-3): 247-249 (2000) - Michel Bousquet, Gilbert Labelle, Pierre Leroux:
Enumeration of planar two-face maps. Discret. Math. 222(1-3): 1-25 (2000) - Yanxun Chang, Giovanni Lo Faro:
Existence of DBIBDs with block size not divided by four. Discret. Math. 222(1-3): 27-40 (2000) - Roberto Cignoli, Antoni Torrens:
Free Stone algebras. Discret. Math. 222(1-3): 251-257 (2000) - Carmen Cortés, Atsuhiro Nakamoto:
Diagonal flips in outer-Klein-bottle triangulations. Discret. Math. 222(1-3): 41-50 (2000) - David Damanik, Douglas Zare:
Palindrome complexity bounds for primitive substitution sequences. Discret. Math. 222(1-3): 259-267 (2000) - Peter Damaschke:
Degree-preserving spanning trees in small-degree graphs. Discret. Math. 222(1-3): 51-60 (2000) - Feng Ming Dong
, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
An attempt to classify bipartite graphs by chromatic polynomials. Discret. Math. 222(1-3): 73-88 (2000) - Hung-Lin Fu, Chin-Lin Shiue:
The optimal pebbling number of the complete m-ary tree. Discret. Math. 222(1-3): 89-100 (2000) - Anna Galluccio, Pavol Hell, Jaroslav Nesetril
:
The complexity of H-colouring of bounded degree graphs. Discret. Math. 222(1-3): 101-109 (2000) - Weidong Gao:
On Davenport's constant of finite abelian groups with rank three. Discret. Math. 222(1-3): 111-124 (2000) - Gregory Z. Gutin, Meike Tewes, Anders Yeo:
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. Discret. Math. 222(1-3): 269-274 (2000) - Laurent Habsieger, Alain Plagne:
New lower bounds for covering codes. Discret. Math. 222(1-3): 125-149 (2000) - Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
:
Acyclic domination. Discret. Math. 222(1-3): 151-165 (2000) - Peter Horák, Ladislav Stacho:
A lower bound on the number of hamiltonian cycles. Discret. Math. 222(1-3): 275-280 (2000) - Danica Jakubíková-Studenovská
:
Unoriented graphs of monounary algebras. Discret. Math. 222(1-3): 167-179 (2000) - Johan Jonasson:
An upper bound on the cover time for powers of graphs. Discret. Math. 222(1-3): 181-190 (2000) - Liying Kang, Jinjiang Yuan:
Bondage number of planar graphs. Discret. Math. 222(1-3): 191-198 (2000) - Vadim V. Lozin:
Conic reduction of graphs for the stable set problem. Discret. Math. 222(1-3): 199-211 (2000) - Jixiang Meng, Jianzhong Wang:
A classification of 2-arc-transitive circulant digraphs. Discret. Math. 222(1-3): 281-284 (2000) - Tsuyoshi Nishimura:
On 1-factors and matching extension. Discret. Math. 222(1-3): 285-290 (2000) - José Plínio O. Santos, Paulo Mondek:
A family of partitions with attached parts and 'N copies of N'. Discret. Math. 222(1-3): 213-222 (2000) - Robert Tijdeman:
Fraenkel's conjecture for six sequences. Discret. Math. 222(1-3): 223-234 (2000) - Carl G. Wagner:
The Carlitz lattice path polynomials. Discret. Math. 222(1-3): 291-298 (2000) - Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev:
Feasible edge colorings of trees with cardinality constraints. Discret. Math. 222(1-3): 61-72 (2000) - Winston C. Yang:
Derivatives are essentially integer partitions. Discret. Math. 222(1-3): 235-245 (2000)
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-06-20 16:47 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