Остановите войну!
for scientists:
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 29 matches
- 2000
- Xiaomin Bao:
On the blocking sets in S(3, 6, 22) and S(4, 7, 23). Discret. Math. 219(1-3): 249-252 (2000) - Béla Bollobás, Oliver Riordan:
Polychromatic polynomials. Discret. Math. 219(1-3): 1-7 (2000) - Mieczyslaw Borowiecki, Mariusz Haluszczak, Miroslawa Skowronska:
Minimal reducible bounds for 1-nonouterplanar graphs. Discret. Math. 219(1-3): 9-15 (2000) - Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
Solution to a problem on degree sequences of graphs. Discret. Math. 219(1-3): 253-257 (2000) - Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang:
Clique covering the edges of a locally cobipartite graph. Discret. Math. 219(1-3): 17-26 (2000) - Bruce N. Cooperstein:
A combinatorial construction of a graph with automorphism group SO+(2n, 2). Discret. Math. 219(1-3): 27-35 (2000) - B. Corbas, Graham D. Williams:
Congruence classes in M3(Fq) (q odd). Discret. Math. 219(1-3): 37-47 (2000) - Rajendra S. Deodhar, Murali K. Srinivasan:
Explicit semisymmetric chain decomposition of the partition lattice. Discret. Math. 219(1-3): 259-264 (2000) - Laura L. Dolph, Annmarie Reynolds, James A. Sellers:
Congruences for a restricted m-ary partition function. Discret. Math. 219(1-3): 265-269 (2000) - Steven T. Dougherty, Masaaki Harada, Patrick Solé:
Shadow lattices and shadow codes. Discret. Math. 219(1-3): 49-64 (2000) - Ioana Dumitriu:
On generalized Tribonacci sequences and additive partitions. Discret. Math. 219(1-3): 65-83 (2000) - Keith J. Edwards:
Achromatic number versus pseudoachromatic number: a counterexample to a conjecture of Hedetniemi. Discret. Math. 219(1-3): 271-274 (2000) - John Gimbel, Carsten Thomassen:
Coloring triangle-free graphs with fixed size. Discret. Math. 219(1-3): 275-277 (2000) - Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann:
Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. 219(1-3): 85-95 (2000) - Solomon W. Golomb, Guang Gong, Zong-Duo Dai:
Cyclic inequivalence of cascaded GMW-sequences. Discret. Math. 219(1-3): 279-285 (2000) - Frank Göring:
Short proof of Menger's Theorem. Discret. Math. 219(1-3): 295-296 (2000) - Wolfgang Haas:
Lower bounds for q-ary codes of covering radius one. Discret. Math. 219(1-3): 97-106 (2000) - Günter Heinz:
Lower and upper bounds on the total weight of semi-rich acyclic arrangements of oriented lines in the plane. Discret. Math. 219(1-3): 107-122 (2000) - Robert Johansson:
On the bipartite case of El-Zahárs conjecture. Discret. Math. 219(1-3): 123-134 (2000) - Liying Kang, Mao-cheng Cai:
Upper minus domination in regular graphs. Discret. Math. 219(1-3): 135-144 (2000) - Hal A. Kierstead:
Extending partial colorings of graphs. Discret. Math. 219(1-3): 145-152 (2000) - Sandi Klavzar, Riste Skrekovski:
On median graphs and median grid graphs. Discret. Math. 219(1-3): 287-293 (2000) - Khee Meng Koh, Eng Guan Tay:
On optimal orientations of G vertex-multiplications. Discret. Math. 219(1-3): 153-171 (2000) - Clement W. H. Lam, Ying Miao:
Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. Discret. Math. 219(1-3): 173-185 (2000) - Max Landsberg:
Feedback functions for generating cycles over a finite alphabet. Discret. Math. 219(1-3): 187-194 (2000) - Rao Li:
A Fan-type condition for claw-free graphs to be Hamiltonian. Discret. Math. 219(1-3): 195-205 (2000) - Alan C. H. Ling, Charles J. Colbourn:
Modified group divisible designs with block size four. Discret. Math. 219(1-3): 207-221 (2000) - Hua Peng, Catherine Huafei Yan:
On the discrepancy of strongly unimodular matrices. Discret. Math. 219(1-3): 223-233 (2000) - Takao Ueda:
Gray codes for necklaces. Discret. Math. 219(1-3): 235-248 (2000)
loading more results
failed to load more results, please try again later
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-04-25 15:08 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