Остановите войну!
for scientists:
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
- 1997
- Jørgen Bang-Jensen, Gregory Z. Gutin:
Paths and cycles in extended and decomposable digraphs, . Discret. Math. 164(1-3): 5-19 (1997) - Halina Bielak:
Chromatic uniqueness in a family of 2-connected graphs. Discret. Math. 164(1-3): 21-28 (1997) - Haitze J. Broersma:
A note on the minimum size of a vertex pancyclic graph. Discret. Math. 164(1-3): 29-32 (1997) - Stanislaw Bylka, Jan Komar:
Intersection properties of line graphs. Discret. Math. 164(1-3): 33-45 (1997) - Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs - I. Discret. Math. 164(1-3): 47-65 (1997) - Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Efficiency and effectiveness of normal schedules on three dedicated processors. Discret. Math. 164(1-3): 67-79 (1997) - Hoa Vu Dinh:
Path partition number in tough graphs. Discret. Math. 164(1-3): 291-294 (1997) - Paul Erdös:
Some recent problems and results in graph theory. Discret. Math. 164(1-3): 81-85 (1997) - Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek:
Claw-free graphs - A survey. Discret. Math. 164(1-3): 87-147 (1997) - Izolda Gorgol:
On bounds for size Ramsey numbers of a complete tripartite graph. Discret. Math. 164(1-3): 149-153 (1997) - Harald Gropp:
Configurations and graphs - II. Discret. Math. 164(1-3): 155-163 (1997) - Yubao Guo, Axel Pinkernell, Lutz Volkmann:
On cycles through a given vertex in multipartite tournaments. Discret. Math. 164(1-3): 165-170 (1997) - Mirko Hornák, Stanislav Jendrol':
On the d-distance face chromatic number of plane graphs. Discret. Math. 164(1-3): 171-174 (1997) - Gyula O. H. Katona:
Extremal problems for finite sets and convex hulls - A survey. Discret. Math. 164(1-3): 175-185 (1997) - Gyula Y. Katona:
Toughness and edge-toughness. Discret. Math. 164(1-3): 187-196 (1997) - Marek Kubale, Jaroslaw Pakulski, Konrad Piwakowski:
The smallest hard-to-color graph for the SL algorithm. Discret. Math. 164(1-3): 197-212 (1997) - Maria Kwasnik, Alina Szelecka:
Strong perfectness of the generalized Cartesian product of graphs. Discret. Math. 164(1-3): 213-220 (1997) - Zbigniew Lonc:
Delta-system decompositions of graphs. Discret. Math. 164(1-3): 221-224 (1997) - Zofia Majcher, Jerzy Michael:
Degree sequences of highly irregular graphs. Discret. Math. 164(1-3): 225-236 (1997) - Zofia Majcher, Jerzy Michael:
Highly irregular graphs with extreme numbers of edges. Discret. Math. 164(1-3): 237-242 (1997) - Konrad Piwakowski:
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors. Discret. Math. 164(1-3): 243-249 (1997) - Andrzej Rucinski, Miroslaw Truszczynski:
A note on local colorings of graphs. Discret. Math. 164(1-3): 251-255 (1997) - Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak:
Preface. Discret. Math. 164(1-3): 1-4 (1997) - Zdenek Ryjácek:
Matching extension in K1, r-free graphs with independent claw centers. Discret. Math. 164(1-3): 257-263 (1997) - Jean-François Saclé, Mariusz Wozniak:
A note on packing of three forests. Discret. Math. 164(1-3): 265-274 (1997) - Günter Schaar:
On the Hamiltonicity exponent of directed cacti. Discret. Math. 164(1-3): 275-284 (1997) - Günter Schaar, A. Pawel Wojda:
An upper bound for the Hamiltonicity exponent of finite digraphs. Discret. Math. 164(1-3): 313-316 (1997) - Jerzy Topp, Preben D. Vestergaard:
Totally equimatchable graphs. Discret. Math. 164(1-3): 285-290 (1997) - Andrzej Wloch, Iwona Wloch:
On (k, l)-kernels in generalized products. Discret. Math. 164(1-3): 295-301 (1997) - A. Pawel Wojda, Paul Vaderlind:
Packing bipartite graphs. Discret. Math. 164(1-3): 303-311 (1997)
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-04-24 13:44 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