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 32 matches
- 1979
- B. Devadas Acharya:
On the cyclomatic number of a hypergraph. Discret. Math. 27(2): 111-116 (1979) - David K. Arrowsmith, Michael A. A. Cox, John W. Essam:
The family of D-weights for a two-rooted graph. Discret. Math. 27(3): 215-223 (1979) - A. Békéssy, János Demetrovics:
Contribution to the theory of data base relations. Discret. Math. 27(1): 1-10 (1979) - Russell Belding:
Structures characterizing partially ordered sets, and their automorphism groups. Discret. Math. 27(2): 117-126 (1979) - Robert G. Bland, H.-C. Huang, Leslie E. Trotter Jr.:
Graphical properties related to minimal imperfection. Discret. Math. 27(1): 11-22 (1979) - Mouloud Boulala, Jean-Pierre Uhry:
Polytope des independants d'un graphe serie-parallele. Discret. Math. 27(3): 225-243 (1979) - Richard A. Brualdi:
The diagonal hypergraph of a matrix (bipartite graph). Discret. Math. 27(2): 127-147 (1979) - Paul A. Catlin:
Subgraphs with triangular components. Discret. Math. 27(2): 149-170 (1979) - Chong-Yun Chao, Earl Glen Whitehead Jr.:
Chromatically unique graphs. Discret. Math. 27(2): 171-177 (1979) - Charalambos A. Charalambides:
A problem of arrangements on chessboards and generalizations. Discret. Math. 27(2): 179-186 (1979) - Philippe Delsarte:
A generalization of the Legendre symbol for finite Abelian groups. Discret. Math. 27(2): 187-192 (1979) - Robert W. Deming:
Independence numbers of graphs-an extension of the Koenig-Egervary theorem. Discret. Math. 27(1): 23-33 (1979) - Walter A. Deuber:
Partition theorems for unary algebras. Discret. Math. 27(1): 35-45 (1979) - C. W. Evans:
Net structure and cages. Discret. Math. 27(2): 193-204 (1979) - James Wildon Fickett:
High valency subgraphs of cubes. Discret. Math. 27(2): 211-212 (1979) - Alexandru Filipoiu:
Representation theorems for Lukasiewicz algebras. Discret. Math. 27(1): 107-110 (1979) - Joseph A. Gallian, David J. Rusin:
Cyclotomic polynomials and nonstandard dice. Discret. Math. 27(3): 245-259 (1979) - William H. Gates, Christos H. Papadimitriou:
Bounds for sorting by prefix reversal. Discret. Math. 27(1): 47-57 (1979) - Charlotte Huang, Anton Kotzig, Alexander Rosa:
On a variation of the Oberwolfach problem. Discret. Math. 27(3): 261-277 (1979) - François Jaeger:
Interval matroids and graphs. Discret. Math. 27(3): 331-336 (1979) - Meir Katchalski, A. Liu:
Arcs on the circle and p-tuplets on the line. Discret. Math. 27(1): 59-69 (1979) - Germain Kreweras:
Sur les extensions lineaires d'une famille particuliere d'ordres partiels. Discret. Math. 27(3): 279-295 (1979) - Aldo de Luca, Dominique Perrin, Antonio Restivo, Settimo Termini:
Synchronization and simplification. Discret. Math. 27(3): 297-308 (1979) - Brendan D. McKay:
Hadamard equivalence via graph isomorphism. Discret. Math. 27(2): 213-214 (1979) - Charles Payan, Nguyen Huy Xuong:
Upper embeddability and connectivity of graphs. Discret. Math. 27(1): 71-80 (1979) - Douglas G. Rogers:
The enumeration of some restricted matrices. Discret. Math. 27(1): 81-91 (1979) - Rüdiger Schmidt:
On the existence of uncountably many matroidal families. Discret. Math. 27(1): 93-97 (1979) - Marc Snir:
The covering problem of complete uniform hypergraphs. Discret. Math. 27(1): 103-105 (1979) - F. Sterboul:
Smallest 3-graphs having a 3-colored edge in every k-coloring. Discret. Math. 27(2): 205-210 (1979) - Dominique de Werra:
Regular and canonical colorings. Discret. Math. 27(3): 309-316 (1979)
skipping 2 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-12-23 18:17 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