Остановите войну!
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 30 matches
- 2003
- Dragic Bankovic:
Distance in Post algebras. Discret. Math. 263(1-3): 269-274 (2003) - A. Benkouar, Yannis Manoussakis, Rachid Saad:
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. Discret. Math. 263(1-3): 1-10 (2003) - Dumitru Busneag:
On extensions of pseudo-valuations on Hilbert algebras. Discret. Math. 263(1-3): 11-24 (2003) - Gary Chartrand, David Erwin, Garry L. Johns, Ping Zhang:
Boundary vertices in graphs. Discret. Math. 263(1-3): 25-34 (2003) - Timothy Y. Chow:
Symplectic matroids, independent sets, and signed graphs. Discret. Math. 263(1-3): 35-45 (2003) - William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel:
Bounds for the chromatic number of graphs with partial information. Discret. Math. 263(1-3): 47-59 (2003) - Sylvie Corteel, Carla D. Savage:
Anti-Lecture Hall Compositions. Discret. Math. 263(1-3): 275-280 (2003) - Robert G. Donnelly, Scott J. Lewis, Robert Pervine:
Constructions of representations of o(2n+1, C) that imply Molev and Reiner-Stanton lattices are strongly Sperner. Discret. Math. 263(1-3): 61-79 (2003) - M. H. Eggar:
A tournament problem. Discret. Math. 263(1-3): 281-288 (2003) - T. Aaron Gulliver, Masaaki Harada, Jon-Lark Kim:
Construction of new extremal self-dual codes. Discret. Math. 263(1-3): 81-91 (2003) - Michael A. Henning:
Total domination excellent trees. Discret. Math. 263(1-3): 93-104 (2003) - Fred B. Holt:
Maximal nonrevisiting paths in simple polytopes. Discret. Math. 263(1-3): 105-128 (2003) - Frank K. Hwang, J. S. Lee, Yu-Chi Liu, Uriel G. Rothblum:
Sortability of vector partitions. Discret. Math. 263(1-3): 129-142 (2003) - Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
Root cases of large sets of t-designs. Discret. Math. 263(1-3): 143-155 (2003) - Sandi Klavzar, Alenka Lipovec:
Partial cubes as subdivision graphs and as generalized Petersen graphs. Discret. Math. 263(1-3): 157-165 (2003) - Yong Hah Lee:
Rough isometry and energy finite solutions of the Schro"dinger operator on graphs. Discret. Math. 263(1-3): 167-177 (2003) - Vadim E. Levit, Eugen Mandrescu:
On alpha+-stable Ko"nig-Egerváry graphs. Discret. Math. 263(1-3): 179-190 (2003) - Sheng-Chyang Liaw, Zhishi Pan, Xuding Zhu:
Construction of Kn-minor free graphs with given circular chromatic number. Discret. Math. 263(1-3): 191-206 (2003) - Hailong Liu, Liang Sun:
The bondage and connectivity of a graph. Discret. Math. 263(1-3): 289-293 (2003) - Terry A. McKee:
Dualizing chordal graphs. Discret. Math. 263(1-3): 207-219 (2003) - Terry A. McKee:
Restricted circular-arc graphs and clique cycles. Discret. Math. 263(1-3): 221-231 (2003) - Sonoko Moriyama, Fumihiko Takeuchi:
Incremental construction properties in dimension two--shellability, extendable shellability and vertex decomposability. Discret. Math. 263(1-3): 295-296 (2003) - Dieter Rautenbach, Lutz Volkmann:
Extremal subgraphs with respect to vertex degree bounds. Discret. Math. 263(1-3): 297-303 (2003) - Gelasio Salazar:
Small meshes of curves and their role in the analysis of optimal meshes. Discret. Math. 263(1-3): 233-246 (2003) - Iwao Sato:
Decomposition formulas of zeta functions of graphs and digraphs. Discret. Math. 263(1-3): 305-309 (2003) - Wolfgang Steiner:
Generalized de Bruijn digraphs and the distribution of patterns in ?-expansions. Discret. Math. 263(1-3): 247-268 (2003) - Friedrich Wehrung:
Direct decompositions of non-algebraic complete lattices. Discret. Math. 263(1-3): 311-321 (2003) - Jinjiang Yuan, Qin Wang:
Partition the vertices of a graph into induced matchings. Discret. Math. 263(1-3): 323-329 (2003) - Yue Zhao:
On the edge-reconstruction of graphs embedded in surfaces IV. Discret. Math. 263(1-3): 331-338 (2003) - Guofei Zhou:
A note on graphs of class I. Discret. Math. 263(1-3): 339-345 (2003)
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-03-28 22:33 CET 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