Остановите войну!
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 23 matches
- 2017
- Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
On the double Roman domination in graphs. Discret. Appl. Math. 232: 1-7 (2017) - Yasmeen Akhtar, Soumen Maity:
Mixed covering arrays on 3-uniform hypergraphs. Discret. Appl. Math. 232: 8-22 (2017) - Mustapha Aouchiche, Pierre Hansen:
The geometric-arithmetic index and the chromatic number of connected graphs. Discret. Appl. Math. 232: 207-212 (2017) - Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-planar graphs. Discret. Appl. Math. 232: 23-40 (2017) - Ravindra B. Bapat, Masoud Karimi, Jia-Bao Liu:
Kirchhoff index and degree Kirchhoff index of complete multipartite graphs. Discret. Appl. Math. 232: 41-49 (2017) - Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. Discret. Appl. Math. 232: 50-63 (2017) - Sergio Bermudo:
On the differential and Roman domination number of a graph with minimum degree two. Discret. Appl. Math. 232: 64-72 (2017) - Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin:
Burning a graph is hard. Discret. Appl. Math. 232: 73-87 (2017) - Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau:
A Vizing-like theorem for union vertex-distinguishing edge coloring. Discret. Appl. Math. 232: 88-98 (2017) - Axel Brandt, Jennifer Diemunsch, Catherine Erbes, J. Legrand, Casey Moffatt:
A robber locating strategy for trees. Discret. Appl. Math. 232: 99-106 (2017) - Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Sojung Lee:
On (1, 2)-step competition graphs of bipartite tournaments. Discret. Appl. Math. 232: 107-115 (2017) - Italo J. Dejter, Oscar Tomaiconza:
Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3. Discret. Appl. Math. 232: 116-124 (2017) - Mitre Costa Dourado, Aline R. da Silva:
Inapproximability results and bounds for the Helly and Radon numbers of a graph. Discret. Appl. Math. 232: 134-141 (2017) - Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed:
Eccentricity approximating trees. Discret. Appl. Math. 232: 142-156 (2017) - Yibin Fang, Yubin Gao:
Counterexamples to the conjecture on orientations of graphs with minimum Wiener index. Discret. Appl. Math. 232: 213-220 (2017) - Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes:
Maintaining balanced trees for structured distributed streaming systems. Discret. Appl. Math. 232: 176-188 (2017) - Ivan Gutman, Shuchao Li, Wei Wei:
Cacti with n-vertices and t cycles having extremal Wiener index. Discret. Appl. Math. 232: 189-200 (2017) - Farzad Farnoud Hassanzadeh, Olgica Milenkovic, Gregory J. Puleo, Lili Su:
Computing similarity distances between rankings. Discret. Appl. Math. 232: 157-175 (2017) - Dan Hu, Xueliang Li, Xiaogang Liu, Shenggui Zhang:
The von Neumann entropy of random multipartite graphs. Discret. Appl. Math. 232: 201-206 (2017) - Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
A note on breaking small automorphisms in graphs. Discret. Appl. Math. 232: 221-225 (2017) - Chunhui Lai:
On the size of graphs without repeated cycle lengths. Discret. Appl. Math. 232: 226-229 (2017) - Uéverton dos Santos Souza, Fábio Protti:
Tractability, hardness, and kernelization lower bound for and/or graph solution. Discret. Appl. Math. 232: 125-133 (2017) - Chuanqi Xiao, Haiyan Chen, Andrei M. Raigorodskii:
A connection between the Kekulé structures of pentagonal chains and the Hosoya index of caterpillar trees. Discret. Appl. Math. 232: 230-234 (2017)
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-23 09:23 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