Остановите войну!
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 36 matches
- 1990
- Moh'd Z. Abu-Sbeih:
On the number of spanning trees of Kn and Km, n. Discret. Math. 84(2): 205-207 (1990) - Ron Aharoni, Ofra Kessler:
On a possible extension of Hall's theorem to bipartite hypergraphs. Discret. Math. 84(3): 309-313 (1990) - Jin Akiyama, Jorge Urrutia:
Simple alternating path problem. Discret. Math. 84(1): 101-103 (1990) - Grahame Bennett:
Coin tossing and moment sequences. Discret. Math. 84(2): 111-118 (1990) - Frank E. Bennett, Beiliang Du, Lie Zhu:
On the existence of (v, 7, 1)-perfect Mendelsohn designs. Discret. Math. 84(3): 221-239 (1990) - Frank E. Bennett, Lisheng Wu, Lie Zhu:
Further results on incomplete (3, 2, 1)- conjugate orthogonal idempotent Latin squares. Discret. Math. 84(1): 1-14 (1990) - A. A. Chernyak, Zh. A. Chernyak:
Pseudodomishold graphs. Discret. Math. 84(2): 193-196 (1990) - Bernard Van Cutsem:
Minimal superior ultrametrics under order constraint. Discret. Math. 84(2): 201-204 (1990) - Margaret Ann Francel:
Possible orders for the stabilizer of a set of M.O.L.S. Discret. Math. 84(2): 119-134 (1990) - Peter Frankl:
An intersection problem for codes. Discret. Math. 84(2): 135-141 (1990) - Hung-Lin Fu:
A note on the ascending subgraph decomposition problem. Discret. Math. 84(3): 315-318 (1990) - Michael Gilpin, Robert Shelton:
Predicates whose maximal length functions increase periodically. Discret. Math. 84(1): 15-21 (1990) - Guy Giraud:
Remarques sur deux problemes extremaux. Discret. Math. 84(3): 319-321 (1990) - Peter Horák, Jozef Sirán:
Solution of two problems of P. Erdös concerning Hamiltonian cycles. Discret. Math. 84(1): 23-29 (1990) - Lih-Hsing Hsu:
Generalized homomorphism graph functions. Discret. Math. 84(1): 31-37 (1990) - Bill Jackson, Oscar Ordaz:
Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey. Discret. Math. 84(3): 241-254 (1990) - Elzbieta B. Jarrett:
Two families of graphs satisfying the cycle basis interpolation property. Discret. Math. 84(1): 39-46 (1990) - Stanislav Jendrol', Michal Tkác:
Convex 3-polytopes with exactly two types of edges. Discret. Math. 84(2): 143-160 (1990) - James T. Joichi:
Hecke-Rogers, Andrews identities; combinatorial proofs. Discret. Math. 84(3): 255-259 (1990) - Tom Knoblauch:
Using triangles to partition a disk. Discret. Math. 84(2): 209-211 (1990) - Christiane Lefèvre-Percsy, Laurence Van Nypelseer:
Finite rank 3 geometries with affine planes and dual affine point residues. Discret. Math. 84(2): 161-167 (1990) - Yanpei Liu:
On chromatic and dichromatic sum equations. Discret. Math. 84(2): 169-179 (1990) - Nicola Martinov:
A recursive characterization of the 4-connected graphs. Discret. Math. 84(1): 105-108 (1990) - Roy Meshulam:
An uncertainty inequality and zero subsums. Discret. Math. 84(2): 197-200 (1990) - Michel Mollard, Charles Payan:
Some progress in the packing of equal circles in a square. Discret. Math. 84(3): 303-307 (1990) - Ronald C. Mullin, Douglas R. Stinson:
Pairwise balanced designs with odd block sizes exceeding five. Discret. Math. 84(1): 47-62 (1990) - Paul C. van Oorschot, Scott A. Vanstone:
On splitting sets in block designs and finding roots of polynomials. Discret. Math. 84(1): 71-85 (1990) - A. G. Robinson, Alan J. Goldman:
On the set coincidence game. Discret. Math. 84(3): 261-283 (1990) - Moshe Rosenfeld:
The number of cycles in 2-factors of cubic graphs. Discret. Math. 84(3): 285-294 (1990) - Sadao Saito, Takanori Hayasaka:
Langford sequences: Some connections with complete and additive permutations. Discret. Math. 84(1): 63-70 (1990)
skipping 6 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-04-17 22:06 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