Остановите войну!
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 21 matches
- 1995
- Douglas Dunham, Douglas S. Jungreis, Dave Witte:
Infinite Hamiltonian paths in Cayley diagraphs of hyperbolic symmetry groups. Discret. Math. 143(1-3): 1-30 (1995) - Jean-Marc Fedou, Don Rawlings:
Statistics on pairs of permutations. Discret. Math. 143(1-3): 31-45 (1995) - Hortensia Galeana-Sánchez:
B1- and B2-orientable graphs in kernel theory. Discret. Math. 143(1-3): 269-274 (1995) - Jerrold R. Griggs, Yan-Chyuan Lin:
Planar graphs with few vertices of small degree. Discret. Math. 143(1-3): 47-70 (1995) - Jonathan L. Gross, Thomas W. Tucker:
Stratified graphs for imbedding systems. Discret. Math. 143(1-3): 71-85 (1995) - Julie Haviland:
Independent domination in regular graphs. Discret. Math. 143(1-3): 275-280 (1995) - Michael Hofmeister:
Graph covering projections arising from finite vector spaces over finite fields. Discret. Math. 143(1-3): 87-97 (1995) - János Komlós, William O. J. Moser:
Almost all trees have tribe number 2 or 3. Discret. Math. 143(1-3): 281-285 (1995) - Roger Labahn:
Kernels of minimum size gossip schemes. Discret. Math. 143(1-3): 99-139 (1995) - Hong-Jian Lai, Guoqing Weng:
Strength and fractional arboricity of complementary graphs. Discret. Math. 143(1-3): 141-151 (1995) - Guizhen Liu:
Orthogonal (g, f)-factorizations in graphs. Discret. Math. 143(1-3): 153-158 (1995) - Jiuqiang Liu, Kenneth Williams:
On bandwidth and edgesum for the composition of two graphs. Discret. Math. 143(1-3): 159-166 (1995) - Klaus Metsch:
Quasi-residual designs, 1 1/2-designs, and strongly regular multigraphs. Discret. Math. 143(1-3): 167-188 (1995) - Y. Miao, L. Zhu:
Perfect Mendelsohn designs with block size six. Discret. Math. 143(1-3): 189-207 (1995) - Bruce P. Mull, Dionysios Kountanis, Reza Rashidi:
Uniform strong 2-cell imbeddings of bridgeless graphs. Discret. Math. 143(1-3): 209-220 (1995) - Xiaojun Shen:
Generalized Latin squares II. Discret. Math. 143(1-3): 221-242 (1995) - Xiang-Ying Su:
On complete subgraphs of color-critical graphs. Discret. Math. 143(1-3): 243-249 (1995) - Shinsei Tazawa, Chiê Nara, John W. Moon:
The number of 4-cycles in triangle-free oriented graphs. Discret. Math. 143(1-3): 287-291 (1995) - Wlodzimierz Ulatowski:
Cycle interpolation properties of graphs. Discret. Math. 143(1-3): 251-257 (1995) - Liu Yan:
A Family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation property. Discret. Math. 143(1-3): 293-297 (1995) - Wenan Zang:
Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs. Discret. Math. 143(1-3): 259-268 (1995)
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-24 00:44 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