![](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 37 matches
- 2002
- Jorge L. Ramírez Alfonsín, David Romero:
Embeddability of the combinohedron. Discret. Math. 254(1-3): 473-483 (2002) - Elisabetta Barletta, Sorin Dragomir:
Combinatorial PDEs on Hamming graphs. Discret. Math. 254(1-3): 1-18 (2002) - Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-colorings. Discret. Math. 254(1-3): 19-32 (2002) - Thomas A. Carlson:
The edge-isoperimetric problem for discrete tori. Discret. Math. 254(1-3): 33-49 (2002) - Bor-Liang Chen, Kuo-Ching Huang:
On the linear k-arboricity of Kn and Kn, n. Discret. Math. 254(1-3): 51-61 (2002) - Carmen Cortés, Clara I. Grima, Alberto Márquez, Atsuhiro Nakamoto:
Diagonal flips in outer-triangulations on closed surfaces. Discret. Math. 254(1-3): 63-74 (2002) - Emeric Deutsch, Marc Noy:
Statistics on non-crossing trees. Discret. Math. 254(1-3): 75-87 (2002) - Guoli Ding:
On interval clutters. Discret. Math. 254(1-3): 89-102 (2002) - Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis:
Totally magic graphs. Discret. Math. 254(1-3): 103-113 (2002) - Shaun M. Fallat, Steve Kirkland, Sukanta Pati:
Minimizing algebraic connectivity over connected graphs with fixed girth. Discret. Math. 254(1-3): 115-142 (2002) - Shannon L. Fitzpatrick, Gary MacGillivray, Devon McCrea:
Total domination in complements of graphs containing no K4, 4. Discret. Math. 254(1-3): 143-151 (2002) - Ian P. Goulden, Alexander Yong:
Dyck paths and a bijection for multisets of hook numbers. Discret. Math. 254(1-3): 153-164 (2002) - Fumio Hazama:
On the kernels of the incidence matrices of graphs. Discret. Math. 254(1-3): 165-174 (2002) - Michael A. Henning:
Restricted domination in graphs. Discret. Math. 254(1-3): 175-189 (2002) - Iiro S. Honkala, Tero Laihonen
, Sanna M. Ranto
:
On strongly identifying codes. Discret. Math. 254(1-3): 191-205 (2002) - Gil Kaplan, Arieh Lev, Yehuda Roditty:
Transitive large sets of disjoint decompositions and group sequencings. Discret. Math. 254(1-3): 207-219 (2002) - Martin Kochol:
Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property. Discret. Math. 254(1-3): 221-230 (2002) - Werner Kuich:
Formal series over sorted algebras. Discret. Math. 254(1-3): 231-258 (2002) - Jian-Guo Lei:
On large sets of Kirkman systems with holes. Discret. Math. 254(1-3): 259-274 (2002) - Xiangwen Li, Bing Wei
, Zhengguang Yu, Yongjin Zhu:
Hamilton cycles in 1-tough triangle-free graphs. Discret. Math. 254(1-3): 275-287 (2002) - Csaba Magyar, Ryan R. Martin
:
Tripartite version of the Corrádi-Hajnal theorem. Discret. Math. 254(1-3): 289-308 (2002) - Bernard Mans
, Francesco Pappalardi
, Igor E. Shparlinski
:
On the spectral Ádám property for circulant graphs. Discret. Math. 254(1-3): 309-329 (2002) - Gregory L. McColm:
MSO zero-one laws on random labelled acyclic graphs. Discret. Math. 254(1-3): 331-347 (2002) - Aurora Morgana, Henry Martyn Mulder:
The induced path convexity, betweenness, and svelte graphs. Discret. Math. 254(1-3): 349-370 (2002) - S. R. Nagpaul, S. K. Jain:
Columns of uniform color in a rectangular array with rows having cyclically repeated color patterns. Discret. Math. 254(1-3): 371-392 (2002) - Zhishi Pan, Xuding Zhu:
Tight relation between the circular chromatic number and the girth of series-parallel graphs. Discret. Math. 254(1-3): 393-404 (2002) - Nicholas Pippenger:
Galois theory for minors of finite functions. Discret. Math. 254(1-3): 405-419 (2002) - Philippe Pitteloud:
Log-concavity and compressed ideals in certain Macaulay posets. Discret. Math. 254(1-3): 421-432 (2002) - Dominique Poulalhon, Gilles Schaeffer:
Factorizations of large cycles in the symmetric group. Discret. Math. 254(1-3): 433-458 (2002) - Helmut Prodinger:
Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima. Discret. Math. 254(1-3): 459-471 (2002)
skipping 7 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-06-21 10:24 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