![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.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
- 1996
- Lars Døvling Andersen, Preben D. Vestergaard:
Graphs with all spanning trees nonisomorphic. Discret. Math. 155(1-3): 3-12 (1996) - Adriano Barlotti, Mario Gionfriddo, Giuseppe Tallini:
Preface. Discret. Math. 155(1-3): 1 (1996) - Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman:
A note on dominating cycles in 2-connected graphs. Discret. Math. 155(1-3): 13-18 (1996) - B. E. Brunton, B. J. Wilson, Terry S. Griggs:
Graphs which have n/2-minimal line-distinguishing colourings. Discret. Math. 155(1-3): 19-26 (1996) - M. Burzio, Jan Pelant:
On complete strongly connected digraphs with the least number of 3-cycles. Discret. Math. 155(1-3): 27-30 (1996) - William Cherowitzo:
Hyperovals in Desarguesian planes: An update. Discret. Math. 155(1-3): 31-38 (1996) - R. Procesi Ciampi:
Stone's representation theorem for Boolean hyperalgebras topological version. Discret. Math. 155(1-3): 211-214 (1996) - Dietmar Cieslik, Johann Linhart:
Steiner minimal trees in Lp2. Discret. Math. 155(1-3): 39-48 (1996) - Josep Fàbrega
, Miguel Angel Fiol:
On the extraconnectivity of graphs. Discret. Math. 155(1-3): 49-57 (1996) - Peter B. Gibbons, Eric Mendelsohn:
The construction of antipodal triple systems by simulated annealing. Discret. Math. 155(1-3): 59-76 (1996) - Mario Gionfriddo, Salvatore Milici:
A result concerning two conjectures of Berge and Chvátal. Discret. Math. 155(1-3): 77-79 (1996) - Harald Gropp:
On tactical configurations, regular bipartite graphs, and (v, k, even)-designs. Discret. Math. 155(1-3): 81-98 (1996) - Frank Harary, Teresa W. Haynes:
Nordhaus-Gaddum inequalities for domination in graphs. Discret. Math. 155(1-3): 99-105 (1996) - James W. P. Hirschfeld, György Kiss:
Tangent sets in finite spaces. Discret. Math. 155(1-3): 107-119 (1996) - Herbert Hotje:
Kinematic mappings of plane affinities. Discret. Math. 155(1-3): 121-125 (1996) - Vikram Jha, Gregory P. Wene:
An oval partition of the central units of certain semifield planes. Discret. Math. 155(1-3): 127-134 (1996) - Sandi Klavzar:
Coloring graph products - A survey. Discret. Math. 155(1-3): 135-145 (1996) - Emanuel Kolb:
Hjelmslev planes over nearrings. Discret. Math. 155(1-3): 147-155 (1996) - Josef Lauri:
Large sets of pseudosimilar vertices. Discret. Math. 155(1-3): 157-160 (1996) - Horst Martini:
Shadow-boundaries of convex bodies. Discret. Math. 155(1-3): 161-172 (1996) - Bojan Mohar:
Straight-line representations of maps on the torus and other flat surfaces. Discret. Math. 155(1-3): 173-181 (1996) - Antonio Pasini, Sergei Tsaranov:
Bounding the size of certain rank 3 geometries with designs as rank 2 residues. Discret. Math. 155(1-3): 183-204 (1996) - Giustina Pica:
On finite Cn-geometries with thick lines. Discret. Math. 155(1-3): 205-210 (1996) - Rosaria Rota:
Hyperaffine planes over hyperrings. Discret. Math. 155(1-3): 215-223 (1996) - Norma Zagaglia Salvi:
Maximal intersection critical families of finite sets. Discret. Math. 155(1-3): 267-269 (1996) - Stephanos Spartalis:
On the number of Hv-rings with P-hyperoperations. Discret. Math. 155(1-3): 225-231 (1996) - Antonino Giorgio Spera:
Transitive extensions of imprimitive groups. Discret. Math. 155(1-3): 233-241 (1996) - Yves Sureau:
On structure of cogroups. Discret. Math. 155(1-3): 243-246 (1996) - Jerzy Topp
, Preben D. Vestergaard:
On numbers of vertices of maximum degree in the spanning trees of a graph. Discret. Math. 155(1-3): 247-258 (1996) - Thomas Vougiouklis:
Hv-groups defined on the same set. Discret. Math. 155(1-3): 259-265 (1996)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.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-07-25 22:05 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