![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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
- 1981
- H. L. Abbott, A. C. Liu:
On property B(s), II. Discret. Math. 37(2-3): 135-141 (1981) - Jaromir Abrham, Anton Kotzig:
Skolem sequences and additive permutations. Discret. Math. 37(2-3): 143-146 (1981) - B. A. Anderson, Philip A. Leonard:
Some Howell Designs of prime side II. Discret. Math. 37(1): 1-18 (1981) - Jacques Aubert, Bernadette Schneider:
Decomposition de Km+Kn en cycles hamiltoniens. Discret. Math. 37(1): 19-27 (1981) - Eiichi Bannai, Tatsuro Ito:
Regular graphs with excess one. Discret. Math. 37(2-3): 147-158 (1981) - Bhagwandas, William G. Bridges:
Applications of algebraic duality to group divisible structures. Discret. Math. 37(2-3): 159-166 (1981) - Agnes Hui Chan:
Embedding of a pseudo-point residual design into a Möbius plane. Discret. Math. 37(1): 29-33 (1981) - Michel Chein, Michel Habib, M. C. Maurer:
Partitive hypergraphs. Discret. Math. 37(1): 35-50 (1981) - Prabir Das:
Characterization of unigraphic and unidigraphic integer-pair sequences. Discret. Math. 37(1): 51-66 (1981) - Jean-Paul Doignon:
On characterizations of binary and graphic matroids. Discret. Math. 37(2-3): 299-301 (1981) - Wayne M. Dymàcek:
Complements of Steinhaus graphs. Discret. Math. 37(2-3): 167-180 (1981) - Reine Fournier:
Note sur la decomposition de KN0. Discret. Math. 37(1): 115-117 (1981) - Hans-Dietrich O. F. Gronau:
Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I. Discret. Math. 37(1): 67-72 (1981) - Wen-Lian Hsu, George L. Nemhauser:
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. Discret. Math. 37(2-3): 181-191 (1981) - S. A. Joni, Gian-Carlo Rota, Bruce E. Sagan:
From sets to functions: Three elementary examples. Discret. Math. 37(2-3): 193-202 (1981) - A. Donald Keedwell:
On the sequenceability of non-abelian groups of order pq. Discret. Math. 37(2-3): 203-216 (1981) - W. Mielants, G. Bruyneel:
Minimal balanced sets and finite geometries. Discret. Math. 37(1): 73-77 (1981) - Peter Mihók:
On graphs critical with respect to vertex partition numbers. Discret. Math. 37(1): 123-126 (1981) - Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis:
On the existence of frames. Discret. Math. 37(1): 79-104 (1981) - Takao Nishizeki:
On the maximum matchings of regular multigraphs. Discret. Math. 37(1): 105-114 (1981) - George L. O'Brien:
A generalized notion of quotient for finite Abelian groups. Discret. Math. 37(1): 119-121 (1981) - János Pach:
Graphs whose every independent set has a common neighbour. Discret. Math. 37(2-3): 217-228 (1981) - Guy Pasquier:
Binary images of some self-dual codes over GF(2m) with respect to trace-orthogonal basis. Discret. Math. 37(1): 127-129 (1981) - L. J. Senechal:
Chain algebras. Discret. Math. 37(2-3): 229-244 (1981) - H. M. Shefrin:
On the combinatorial structure of Bayesian learning with imperfect information. Discret. Math. 37(2-3): 245-254 (1981) - Richard P. Stanley:
Factorization of permutations into n-cycles. Discret. Math. 37(2-3): 255-262 (1981) - Maciej M. Syslo:
The Helly-type property of non-trivial intervals on a tree. Discret. Math. 37(2-3): 297-298 (1981) - Ioan Tomescu
:
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets. Discret. Math. 37(2-3): 263-277 (1981) - Hian Poh Yap:
On graphs whose maximal subgraphs have at most two orbits. Discret. Math. 37(2-3): 279-287 (1981) - Hian Poh Yap:
On graphs critical with respect to edge-colourings. Discret. Math. 37(2-3): 289-296 (1981)
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-09-11 14:16 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