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
- 1980
- Annie Astié-Vidal:
Factor group of the automorphism group of a matroid basis graph with respect to the automorphism group of the matroid. Discret. Math. 32(3): 217-224 (1980) - Béla Bollobás:
The distribution of the maximum degree of a random graph. Discret. Math. 32(2): 201-203 (1980) - David Burns, S. F. Kapoor, Phillip A. Ostrand:
Edge cosymmetric graphs. Discret. Math. 32(2): 99-103 (1980) - Ottavio M. D'Antona, Joseph P. S. Kung:
Coherent orientations and series-parallel networks. Discret. Math. 32(1): 95-98 (1980) - Dwight Duffus, Ivan Rival, Miklós Simonovits:
Spanning retracts of a partially ordered set. Discret. Math. 32(1): 1-7 (1980) - Reinhardt Euler:
Rank-axiomatic characterizations of independence systems. Discret. Math. 32(1): 9-17 (1980) - Ralph J. Faudree, Richard H. Schelp, J. Sheehan:
Ramsey numbers for matchings. Discret. Math. 32(2): 105-123 (1980) - Steve Fisk, Daniel Abbw-Jackson, Daniel J. Kleitman:
Helly-type theorems about sets. Discret. Math. 32(1): 19-25 (1980) - Philippe Flajolet:
Combinatorial aspects of continued fractions. Discret. Math. 32(2): 125-161 (1980) - John B. Florence:
Consanguinity graphs. Discret. Math. 32(3): 225-228 (1980) - T. Gangopadhyay, Surya Prakash Rao Hebbare:
Paths in r-partite self-complementary graphs. Discret. Math. 32(3): 229-244 (1980) - T. Gangopadhyay, Surya Prakash Rao Hebbare:
r-partite self-complementary graphs - diameters. Discret. Math. 32(3): 245-255 (1980) - Chris D. Godsil:
More odd graph theory. Discret. Math. 32(2): 205-207 (1980) - Jacob E. Goodman:
Proof of a conjecture of Burr, Grünbaum, and Sloane. Discret. Math. 32(1): 27-35 (1980) - Ram Prakash Gupta, Jeff Kahn, Neil Robertson:
On the maximum number of diagonals of a circuit in a graph. Discret. Math. 32(1): 37-43 (1980) - Yahya Ould Hamidoune:
On critically h-connected simple graphs. Discret. Math. 32(3): 257-262 (1980) - Joram Hirschfeld:
A lower bound for Ramsey's theorem. Discret. Math. 32(1): 89-91 (1980) - Frank K. Hwang:
An explicit expression for the cost of a class of Huffman trees. Discret. Math. 32(2): 163-165 (1980) - Medha Javdekar:
Characterization of k-variegated graphs, k >= 3. Discret. Math. 32(3): 263-270 (1980) - David Klarner, Jordan Pollack:
Domino tilings of rectangles with fixed width. Discret. Math. 32(1): 45-52 (1980) - Peter Kleinschmidt:
A steinitz-type theorem for the projective plane. Discret. Math. 32(1): 53-57 (1980) - Jean-Marie Laborde:
Sur le cardinal maximum de la base complete d'une fonction booleenne, en fonction du nombre de conjonctions de l'une de ses formes normales. Discret. Math. 32(2): 209-212 (1980) - Charles C. Lindner, N. S. Mendelsohn, S. R. Sun:
On the construction of Schroeder quasigroups. Discret. Math. 32(3): 271-280 (1980) - Hiroshi Maehara:
On time graphs. Discret. Math. 32(3): 281-289 (1980) - Stephen B. Maurer, Issie Rabinovich, William T. Trotter:
A generalization of Turán's theorem to directed graphs. Discret. Math. 32(2): 167-189 (1980) - Gary L. Mullen, Robert E. Weber:
Latin cubes of order >=5. Discret. Math. 32(3): 291-297 (1980) - Myriam Preissmann:
Even polyhedral decompositions of cubic graphs. Discret. Math. 32(3): 331-334 (1980) - Oliver Pretzel:
A construction for partially ordered sets. Discret. Math. 32(1): 59-68 (1980) - James W. Reilly, Stephen M. Tanny:
Counting permutations by successions and other figures. Discret. Math. 32(1): 69-76 (1980) - Arthur J. Roth, Milton Sobel:
A probabilistically attained set of polynomials that generate stirling numbers of the second kind. Discret. Math. 32(1): 77-84 (1980)
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-10-10 17:21 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