Остановите войну!
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 27 matches
- 2024
- Aida Abiad, Robin Simoens, Sjanne Zeijlemaker:
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme. Discret. Appl. Math. 348: 221-230 (2024) - Manoj Changat, Gokul Krishna Gopakumar-Sheejakumari, Prasanth G. Narasimha-Shenoi:
The median function of a block graph: Axiomatic characterizations. Discret. Appl. Math. 348: 246-259 (2024) - Yuanyuan Chen, Dan Li, Huiqiu Lin, Jixiang Meng:
Some graphs determined by their Aα-spectra. Discret. Appl. Math. 348: 46-55 (2024) - Grega Cigler, Piotr J. Wojciechowski:
Algebraic properties of soluble posets. Discret. Appl. Math. 348: 211-220 (2024) - Karel Devriendt, Andrea Ottolini, Stefan Steinerberger:
Graph curvature via resistance distance. Discret. Appl. Math. 348: 68-78 (2024) - Margarita Domènech, José Miguel Giménez, María Albina Puente:
New characterizations and a concept of potential for each multinomial (probabilistic) value. Discret. Appl. Math. 348: 56-67 (2024) - Éric Duchêne, Arthur Dumas, Nacim Oijid, Aline Parreau, Eric Rémila:
The Maker-Maker domination game in forests. Discret. Appl. Math. 348: 6-34 (2024) - Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms. Discret. Appl. Math. 348: 301-319 (2024) - Shaun M. Fallat, Neha Joshi, Roghayeh Maleki, Karen Meagher, Seyed Ahmad Mojallal, Shahla Nasserasr, Mahsa N. Shirazi, Andriaherimanana Sarobidy Razafimahatratra, Brett Stevens:
The q-analogue of zero forcing for certain families of graphs. Discret. Appl. Math. 348: 91-104 (2024) - Wei Gao:
The minimum ABC index of chemical trees. Discret. Appl. Math. 348: 132-143 (2024) - Yuanqiu Huang, Licheng Zhang, Fengming Dong:
A new note on 1-planar graphs with minimum degree 7. Discret. Appl. Math. 348: 165-183 (2024) - Prahlad Narasimhan Kasthurirangan:
One-sided terrain guarding and chordal graphs. Discret. Appl. Math. 348: 192-201 (2024) - Ivo Koch, Nina Pardal, Vinícius Fernandes dos Santos:
Edge deletion to tree-like graph classes. Discret. Appl. Math. 348: 122-131 (2024) - Pingshan Li, Min Xu, Eddie Cheng:
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs. Discret. Appl. Math. 348: 152-158 (2024) - Hechao Liu, Lihua You:
Extremal Kirchhoff index in polycyclic chains. Discret. Appl. Math. 348: 292-300 (2024) - Atílio G. Luiz:
Roman domination and independent Roman domination on graphs with maximum degree three. Discret. Appl. Math. 348: 260-278 (2024) - Alice Raffaele, Romeo Rizzi, Takeaki Uno:
Listing the bonds of a graph in O˜(n)-delay. Discret. Appl. Math. 348: 105-121 (2024) - Saeed Shaebani:
Concerning a conjecture on matching Kneser graphs. Discret. Appl. Math. 348: 87-90 (2024) - M. A. Shalu, V. K. Kirubakaran:
On CD-chromatic number and its lower bound in some classes of graphs. Discret. Appl. Math. 348: 202-210 (2024) - Jialei Song, Baogang Xu:
Divisibility and coloring of some P5-free graphs. Discret. Appl. Math. 348: 144-151 (2024) - Meng Tang, Fengxia Liu, Hong-Jian Lai:
The list r-hued coloring of Km,n. Discret. Appl. Math. 348: 159-164 (2024) - Rong Zhang, Shu-Guang Guo:
Maxima of the Aα-index of graphs with given size and domination number. Discret. Appl. Math. 348: 35-45 (2024) - Licheng Zhang, Yuanqiu Huang:
On the sizes of generalized cactus graphs. Discret. Appl. Math. 348: 184-191 (2024) - Xuechun Zhang, Hongliang Lu, Qinglin Yu:
A note on the minimum size of matching-saturated graphs. Discret. Appl. Math. 348: 1-5 (2024) - Lin Zheng, Shuchao Li, Xiaobing Luo, Guangfu Wang:
Some sufficient conditions for a graph with minimum degree to be k-factor-critical. Discret. Appl. Math. 348: 279-291 (2024) - Ting Zhou, Lianying Miao, Wenyao Song:
On the eccentric distance sum of trees with given maximum degree. Discret. Appl. Math. 348: 79-86 (2024) - Rong Zou, Genjiu Xu, Wenzhong Li, Panfei Sun:
Values for cooperative games with a prior unions and a communication graph based on combined effects. Discret. Appl. Math. 348: 231-245 (2024)
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-08-02 20: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