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
- 1994
- Shreeram S. Abhyankar, Jun Ou, Avinash Sathaye:
Alternating group coverings of the affine line for characteristic two. Discret. Math. 133(1-3): 25-46 (1994) - Shreeram S. Abhyankar, Ikkwon Yie:
Small degree coverings of the affine line in characteristic two. Discret. Math. 133(1-3): 1-23 (1994) - Horst Alzer:
An inequality for increasing sequences and its integral analogue. Discret. Math. 133(1-3): 279-283 (1994) - Ahmed M. Assaf:
Bipacking pairs by quintuples: The case nu=13 (mod 20). Discret. Math. 133(1-3): 47-54 (1994) - Frank W. Barnes:
How many 1×2×4 bricks can you get into an odd box? Discret. Math. 133(1-3): 55-78 (1994) - Luigi Cerlienco, Marina Mureddu:
Generalized Robinson-Schensted correspondences: a new algorithm. Discret. Math. 133(1-3): 79-88 (1994) - Paul L. Check, Charles J. Colbourn:
Concerning difference families with block size four. Discret. Math. 133(1-3): 285-289 (1994) - Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson:
Contractible edges in longest cycles in non-Hamiltonian graphs. Discret. Math. 133(1-3): 89-98 (1994) - Winfried Geyer:
On Tamari lattices. Discret. Math. 133(1-3): 99-122 (1994) - D. Frank Hsu, Tomasz Luczak:
On the k-diameter of k-regular k-connected graphs. Discret. Math. 133(1-3): 291-296 (1994) - Robert B. Hughes:
Lower bounds on cube simplexity. Discret. Math. 133(1-3): 123-138 (1994) - Alexander V. Ivashchenko:
Some properties of contractible transformations on graphs. Discret. Math. 133(1-3): 139-145 (1994) - Zygmunt Jackowski:
Characterizations of two classes of digraphs. Discret. Math. 133(1-3): 147-157 (1994) - Ming Jiang, Frank Ruskey:
Determining the hamilton-connectedness of certain vertex-transitive graphs. Discret. Math. 133(1-3): 159-169 (1994) - Hiroshi Kimura:
Classification of Hadamard matrices of order 28. Discret. Math. 133(1-3): 171-180 (1994) - Sandi Klavzar, Uros Milutinovic:
Strong products of Kneser graphs. Discret. Math. 133(1-3): 297-300 (1994) - R. Klein:
On the colorability of m-composed graphs. Discret. Math. 133(1-3): 181-190 (1994) - Jan Kratochvíl:
Regular codes in regular graphs are difficult. Discret. Math. 133(1-3): 191-205 (1994) - Anping Li:
On the conjecture at two counterfeit coins. Discret. Math. 133(1-3): 301-306 (1994) - Eric Mendelsohn, P. Rodney:
The existence of court balanced tournament designs. Discret. Math. 133(1-3): 207-216 (1994) - David J. Rasmussen, Carla D. Savage:
Hamilto-connected derangement graphs on S n. Discret. Math. 133(1-3): 217-223 (1994) - James H. Schmerl:
Tiling space with notched cubes. Discret. Math. 133(1-3): 225-235 (1994) - Marcin Jan Schroeder:
Dependence systems with the operator-image exchange property. Discret. Math. 133(1-3): 237-248 (1994) - Yongbing Shi:
The number of cycles in a hamilton graph. Discret. Math. 133(1-3): 249-257 (1994) - Hunter S. Snevily:
The snake-in-the-box problem: A new upper bound. Discret. Math. 133(1-3): 307-314 (1994) - B. Uhrin:
The set of neighbours of a set in a point-lattice. Discret. Math. 133(1-3): 259-266 (1994) - Shaoji Xu:
Classes of chromatically equivalent graphs and polygon trees. Discret. Math. 133(1-3): 267-278 (1994) - Jun-Ming Xu:
A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph. Discret. Math. 133(1-3): 315-318 (1994) - Min Song Zeng, Zhang Ke Min:
Neighborhood unions and Hamiltonian properties. Discret. Math. 133(1-3): 319-324 (1994) - Ke Min Zhang, Yannis Manoussakis, Zeng Min Song:
Complementary cycles containing a fixed arc in diregular bipartite tournaments. Discret. Math. 133(1-3): 325-328 (1994)
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-11-22 16:43 CET 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