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 28 matches
- 1990
- Shreeram S. Abhyankar, Devadatta M. Kulkarni:
Coinsertion and standard bitableaux. Discret. Math. 85(2): 115-166 (1990) - Rudolf Ahlswede, Zen Zhang:
On cloud-antichains and related configurations. Discret. Math. 85(3): 225-245 (1990) - Jin Akiyama, Vasek Chvátal:
Packing paths perfectly. Discret. Math. 85(3): 247-255 (1990) - David W. Barnette:
Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane. Discret. Math. 85(1): 1-16 (1990) - Klaus Bongartz, Detlef Mertens:
On the enumeration of Homeochromatic classes of k-chromatic tilings. Discret. Math. 85(1): 17-42 (1990) - Mao-cheng Cai:
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices. Discret. Math. 85(1): 43-52 (1990) - K. Corrádi, S. Szabó:
Cube tiling and covering a complete graph. Discret. Math. 85(3): 319-321 (1990) - Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Subgraphs of minimal degree k. Discret. Math. 85(1): 53-58 (1990) - Hortensia Galeana-Sánchez:
On the existence of (k, l)-kernels in digraphs. Discret. Math. 85(1): 99-102 (1990) - Gary Gordon, Lorenzo Traldi:
Generalized activities and the tutte polynomial. Discret. Math. 85(2): 167-176 (1990) - András Gyárfás:
A simple lower bound on edge coverings by cliques. Discret. Math. 85(1): 103-104 (1990) - Z. Hasan:
Behavior of Steiner systems of M24. Discret. Math. 85(3): 257-279 (1990) - Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu:
A simple existence criterion for (g<f)- factors. Discret. Math. 85(3): 313-317 (1990) - George R. T. Hendry:
Extending cycles in graphs. Discret. Math. 85(1): 59-72 (1990) - John Isbell:
Sequencing certain dihedral groups. Discret. Math. 85(3): 323-328 (1990) - Dieter Jungnickel:
On the existence of small quasimultiples of affine and projective planes of arbitrary order. Discret. Math. 85(2): 177-189 (1990) - Alexander V. Karzanov:
Packings of cuts realizing distances between certain vertices in a planar graph. Discret. Math. 85(1): 73-87 (1990) - Elaine A. Kasimatis, Sherman K. Stein:
Equidissections of polygons. Discret. Math. 85(3): 281-294 (1990) - Hans Kellerer, Günther Wirsching:
Prime covers and periodic patterns. Discret. Math. 85(2): 191-206 (1990) - Christos Koukouvinos, Stratis Kounias:
Construction of some Hadamard matrices with maximum excess. Discret. Math. 85(3): 295-300 (1990) - Mulan Liu:
Homomorphisms and automorphisms of 2-D de Bruijn-Good graphs. Discret. Math. 85(1): 105-109 (1990) - Tsuyoshi Nishimura:
Regular factors of line graphs. Discret. Math. 85(2): 215-219 (1990) - Norbert Polat:
On the existence of minimal end-separators. Discret. Math. 85(1): 97-98 (1990) - Mark Ramras:
A new method of generating Hamiltonian cycles on the n-cube. Discret. Math. 85(3): 329-331 (1990) - R. Bruce Richter:
Nonplanar graphs and well-covered cycles. Discret. Math. 85(2): 221-222 (1990) - Jiang Zeng:
Un modèle symétrique pour l'identité de Al-Salam-Fields. Discret. Math. 85(2): 207-213 (1990) - Maolin Zheng, Xiaoyun Lu:
On the maximum induced forests of a connected cubic graph without triangles. Discret. Math. 85(1): 89-96 (1990) - Yongjin Zhu, Chuanping Chen:
An extreme problem concerning k-arc-cyclic property for a class of tournaments. Discret. Math. 85(3): 301-311 (1990)
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-19 00:56 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