Остановите войну!
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 27 matches
- 1988
- Noga Alon, Z. Bregman:
Every 8-uniform 8-regular hypergraph is 2-colorable. Graphs Comb. 4(1): 303-306 (1988) - Lars Døvling Andersen, Herbert Fleischner, Bill Jackson:
Removable edges in cyclically 4-edge-connected cubic graphs. Graphs Comb. 4(1): 1-21 (1988) - David Avis, Paul Erdös, János Pach:
Repeated distances in space. Graphs Comb. 4(1): 207-217 (1988) - Eiichi Bannai, Tatsuro Ito:
On distance-regular graphs with fixed valency, II. Graphs Comb. 4(1): 219-228 (1988) - Fred Buckley, Frank Harary:
On the euclidean dimension of a wheel. Graphs Comb. 4(1): 23-30 (1988) - Robert Chen, Frank K. Hwang:
Stronger players win more balanced knockout tournaments. Graphs Comb. 4(1): 95-99 (1988) - Ernest J. Cockayne, P. H. Spencer:
On the independent queens covering problem. Graphs Comb. 4(1): 101-110 (1988) - Michel Deza, N. M. Singhi:
Rigid pentagons in hypercubes. Graphs Comb. 4(1): 31-42 (1988) - Hikoe Enomoto, Takashi Miyamoto, Kazuhiko Ushio:
Ck-factorization of complete bipartite graphs. Graphs Comb. 4(1): 111-113 (1988) - Zoltán Füredi:
Matchings and covers in hypergraphs. Graphs Comb. 4(1): 115-206 (1988) - Chris D. Godsil, Richard J. Nowakowski, Jaroslav Nesetril:
The chromatic connectivity of graphs. Graphs Comb. 4(1): 229-233 (1988) - Martin Charles Golumbic:
Algorithmic aspects of intersection graphs and representation hypergraphs. Graphs Comb. 4(1): 307-321 (1988) - Masatosi Imori, Makoto Matsumoto, Hisao Yamada:
The line digraph of a regular and pancircular digraph is also regular and pancircular. Graphs Comb. 4(1): 235-239 (1988) - Joseph P. S. Kung, James G. Oxley:
Combinatorial geometries representable over GF(3) and GF(q). II. Dowling geometries. Graphs Comb. 4(1): 323-332 (1988) - Esther R. Lamken, Scott A. Vanstone:
Orthogonal resolutions in odd balanced tournament designs. Graphs Comb. 4(1): 241-255 (1988) - Hiroshi Maehara, Jan Reiterman, Vojtech Rödl, Edita Sinajová:
Embedding of trees in euclidean spaces. Graphs Comb. 4(1): 43-47 (1988) - Amram Meir, John W. Moon:
Survival under random coverings of trees. Graphs Comb. 4(1): 49-65 (1988) - Masataka Nakamura:
Structural theorems for submodular functions, polymatroids and polymatroid intersections. Graphs Comb. 4(1): 257-284 (1988) - Katsuhiro Ota:
The number of contractible edges in 3-connected graphs. Graphs Comb. 4(1): 333-354 (1988) - László Pyber:
Finding defective coins. Graphs Comb. 4(1): 393-394 (1988) - Alan Rahilly:
Divisions of symmetric designs into two parts. Graphs Comb. 4(1): 67-73 (1988) - Douglas G. Rogers:
Irregular, extremal perfect systems of difference sets II. Graphs Comb. 4(1): 285-295 (1988) - Jennifer Seberry, Albert Leon Whiteman:
New Hadamard matrices and conference matrices obtained via Mathon's construction. Graphs Comb. 4(1): 355-377 (1988) - N. Srinivasan, Jaroslav Opatrny, Vangalur S. Alagar:
Bigeodetic graphs. Graphs Comb. 4(1): 379-392 (1988) - Sam Stueckle:
On natural isomorphisms of cycle permutation graphs. Graphs Comb. 4(1): 75-85 (1988) - Paul M. Terwilliger:
Balanced sets andQ-polynomial association schemes. Graphs Comb. 4(1): 87-94 (1988) - Mieko Yamada:
On a series of Hadamard matrices of order 2t and the maximal excess of Hadamard matrices of order 22t. Graphs Comb. 4(1): 297-301 (1988)
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-07-04 03:50 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