Остановите войну!
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 40 matches
- 1992
- H. L. Abbott, Geoffrey Exoo:
On set systems not containing delta systems. Graphs Comb. 8(1): 1-9 (1992) - Ron Aharoni, Ron Holzman:
Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality. Graphs Comb. 8(1): 11-22 (1992) - Noga Alon, Zoltán Füredi:
Spanning subgraphs of random graphs. Graphs Comb. 8(1): 91-94 (1992) - Noga Alon, Edward R. Scheinerman:
Generalized sum graphs. Graphs Comb. 8(1): 23-29 (1992) - Noga Alon, Raphael Yuster:
AlmostH-factors in dense graphs. Graphs Comb. 8(2): 95-102 (1992) - Lars Døvling Andersen, Songkang Ding, Gert Sabidussi, Preben D. Vestergaard:
Edge orbits and edge-deleted subgraphs. Graphs Comb. 8(1): 31-44 (1992) - Gerhard Behrendt:
Automorphism groups of graphs with forbidden subgraphs. Graphs Comb. 8(3): 203-206 (1992) - Jürgen Bierbrauer:
Designs with block-size 6 in projective planes of characteristic 2. Graphs Comb. 8(3): 207-224 (1992) - Mostafa Blidia, Konrad Engel:
Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. Graphs Comb. 8(2): 103-108 (1992) - J. Adrian Bondy, Stephen C. Locke:
Triangle-free subgraphs of powers of cycles. Graphs Comb. 8(2): 109-118 (1992) - Bor-Liang Chen, Hung-Lin Fu:
Total colorings of graphs of order 2n having maximum degree 2n-2. Graphs Comb. 8(2): 119-123 (1992) - Lane H. Clark, Roger C. Entringer, Henry D. Shapiro:
Smallest maximally nonhamiltonian graphs II. Graphs Comb. 8(3): 225-231 (1992) - Michel Deza, Monique Laurent, Svatopluk Poljak:
The cut cone III: On the role of triangle facets. Graphs Comb. 8(2): 125-142 (1992) - Ralph J. Faudree, András Gyárfás, Jenö Lehel:
Three-regular path pairable graphs. Graphs Comb. 8(1): 45-52 (1992) - Frantisek Franek, Vojtech Rödl:
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs. Graphs Comb. 8(4): 299-308 (1992) - Peter Frankl, Vojtech Rödl:
The Uniformity Lemma for hypergraphs. Graphs Comb. 8(4): 309-312 (1992) - Zoltán Füredi, Richard P. Stanley:
Sets of vectors with many orthogonal paris. Graphs Comb. 8(4): 391-394 (1992) - Chris D. Godsil, Norbert Seifter:
Graphs with polynomial growth are covering graphs. Graphs Comb. 8(3): 233-241 (1992) - Walter J. Gutjahr, Georg Ch. Pflug:
The asymptotic distribution of leaf heights in binary trees. Graphs Comb. 8(3): 243-251 (1992) - Xiang-dong Hou:
On theG-matrices with entries and eigenvalues inQ(i). Graphs Comb. 8(1): 53-64 (1992) - Andreas Huck, Haruko Okamura:
Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs. Graphs Comb. 8(3): 253-258 (1992) - Noboru Ito, Blessilda P. Raposa:
Nearly triply regular Drad's ofRH type. Graphs Comb. 8(2): 143-153 (1992) - William L. Kocay:
Reconstructing graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems. Graphs Comb. 8(3): 259-276 (1992) - Martin Kochol:
A note on the arboricity of graphs. Graphs Comb. 8(4): 313-315 (1992) - Jin Ho Kwak, Jaeun Lee:
Counting some finite-fold coverings of a graph. Graphs Comb. 8(3): 277-285 (1992) - Bruce M. Landman, Ezra A. Brown, Frederick J. Portier:
Partitions of bi-partite numbers into at mostj parts. Graphs Comb. 8(1): 65-73 (1992) - Warwick de Launey:
CirculantGH(p2; Zp) exist for all primesp. Graphs Comb. 8(4): 317-321 (1992) - Van Bang Le, Erich Prisner:
On inverse problems for the cycle graph operator. Graphs Comb. 8(2): 155-164 (1992) - Hanno Lefmann, Vojtech Rödl, Robin Thomas:
Monochromatic Vs multicolored paths. Graphs Comb. 8(4): 323-332 (1992) - Zbigniew Lonc:
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems. Graphs Comb. 8(4): 333-341 (1992)
skipping 10 more matches
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-05-28 00:37 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