Остановите войну!
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 40 matches
- 2004
- Mohamed El Kadi Abderrezzak, Evelyne Flandrin:
New sufficient conditions for bipancyclic bipartite graphs. Discret. Math. 286(1-2): 5-13 (2004) - Camino Balbuena, Pedro García-Vázquez:
Edge-connectivity in Pk-path graphs. Discret. Math. 286(3): 213-218 (2004) - Krystyna T. Balinska, Slobodan K. Simic, Krzysztof T. Zwierzyski:
Which non-regular bipartite integral graphs with maximum degree four do not have pm1 as eigenvalues? Discret. Math. 286(1-2): 15-24 (2004) - James Boland, Fred Buckley, Mirka Miller:
Eccentric digraphs. Discret. Math. 286(1-2): 25-29 (2004) - Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Peter Mihók:
Minimal vertex Ramsey graphs and minimal forbidden subgraphs. Discret. Math. 286(1-2): 31-36 (2004) - Mieczyslaw Borowiecki, Mariusz Haluszczak, Elzbieta Sidorowicz:
On Ramsey minimal graphs. Discret. Math. 286(1-2): 37-43 (2004) - Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek:
Hamiltonian decompositions of prisms over cubic graphs. Discret. Math. 286(1-2): 45-56 (2004) - Manoj Changat, Joseph Mathews:
Induced path transit function, monotone and Peano axioms. Discret. Math. 286(3): 185-194 (2004) - Andrzej Czygrinow, Brendan Nagle:
Strong edge colorings of uniform graphs. Discret. Math. 286(3): 219-223 (2004) - Rumen N. Daskalov, Elena Metodieva:
The nonexistence of ternary [105, 6, 68] and [230, 6, 152] codes. Discret. Math. 286(3): 225-232 (2004) - Randall J. Elzinga, David A. Gregory, Kevin N. Vander Meulen:
Addressing the Petersen graph. Discret. Math. 286(3): 241-244 (2004) - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
Toughness, degrees and 2-factors. Discret. Math. 286(3): 245-249 (2004) - Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A note on pancyclism of highly connected graphs. Discret. Math. 286(1-2): 57-60 (2004) - Roderick J. Fletcher, Christos Koukouvinos, Jennifer Seberry:
New skew-Hadamard matrices of order 4cdot59 and new D-optimal designs of order 2cdot59. Discret. Math. 286(3): 251-253 (2004) - Tobias Gerlach:
Toughness and Hamiltonicity of a class of planar graphs. Discret. Math. 286(1-2): 61-65 (2004) - Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
The diameter of total domination vertex critical graphs. Discret. Math. 286(3): 255-261 (2004) - Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza:
On short cycles through prescribed vertices of a graph. Discret. Math. 286(1-2): 67-74 (2004) - Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
A note on embedding graphs without short cycles. Discret. Math. 286(1-2): 75-77 (2004) - Joanna Górska, Zdzislaw Skupien, Zofia Majcher, Jerzy Michael:
A smallest irregular oriented graph containing a given diregular one. Discret. Math. 286(1-2): 79-88 (2004) - Andrea Hackmann, Arnfried Kemnitz:
The circular chromatic index. Discret. Math. 286(1-2): 89-93 (2004) - Mohamed El Haddad, Yannis Manoussakis, Rachid Saad:
Upper bounds for the forwarding indices of communication networks. Discret. Math. 286(3): 233-240 (2004) - Jochen Harant:
On paths and cycles through specified vertices. Discret. Math. 286(1-2): 95-98 (2004) - Teresa W. Haynes, Michael A. Henning, Lora Hopkins:
Total domination subdivision numbers of trees. Discret. Math. 286(3): 195-202 (2004) - Michael A. Henning, Jacob Elgin Maritz:
Stratification and domination in graphs II. Discret. Math. 286(3): 203-211 (2004) - Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 286(1-2): 1- (2004) - Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Mixed hypercacti. Discret. Math. 286(1-2): 99-113 (2004) - Tomás Madaras, Riste Skrekovski:
Heavy paths, light stars, and big melons. Discret. Math. 286(1-2): 115-131 (2004) - Karl Mahlburg:
The overpartition function modulo small powers of 2. Discret. Math. 286(3): 263-267 (2004) - Antoni Marczyk:
On the structure of the set of cycle lengths in a hamiltonian graph. Discret. Math. 286(1-2): 133-140 (2004) - Danuta Michalak:
Domination, independence and irredundance with respect to additive induced-hereditary properties. Discret. Math. 286(1-2): 141-146 (2004)
skipping 10 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-05-04 12: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