![](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 35 matches
- 2019
- Yaser Alizadeh
, Ehsan Estaji, Sandi Klavzar
, Marko Petkovsek:
Metric properties of generalized Sierpiński graphs over stars. Discret. Appl. Math. 266: 48-55 (2019) - Benjamin Allgeier, Grzegorz Kubicki:
Boundary-type sets in maximal outerplanar graphs. Discret. Appl. Math. 266: 163-170 (2019) - Angela Angeleska, Zoran Nikoloski:
Coherent network partitions. Discret. Appl. Math. 266: 283-290 (2019) - Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
:
Cyclic deficiency of graphs. Discret. Appl. Math. 266: 171-185 (2019) - Leila Badakhshian, Gyula O. H. Katona
, Zsolt Tuza:
The domination number of the graph defined by two levels of the n-cube. Discret. Appl. Math. 266: 30-37 (2019) - Cristina Bazgan, Henning Fernau
, Zsolt Tuza:
Aspects of upper defensive alliances. Discret. Appl. Math. 266: 111-120 (2019) - Afshin Behmaram
, Cédric Boutillier:
Asymptotic enumeration of perfect matchings in m-barrel fullerene graphs. Discret. Appl. Math. 266: 153-162 (2019) - Peter Borg
, Yair Caro, Kurt Fenech
:
Irregular independence and irregular domination. Discret. Appl. Math. 266: 76-84 (2019) - Izak Broere, Wilfried Imrich
, Rafal Kalinowski
, Monika Pilsniak
:
Asymmetric colorings of products of graphs and digraphs. Discret. Appl. Math. 266: 56-64 (2019) - Richard A. Brualdi, Geir Dahl
:
The interval structure of (0, 1)-matrices. Discret. Appl. Math. 266: 3-15 (2019) - Bart De Bruyn:
A generalization of the Haemers-Mathon bound for near hexagons. Discret. Appl. Math. 266: 272-282 (2019) - Bart De Bruyn, Binod Kumar Sahoo, Bikramaditya Sahu:
Blocking sets of tangent lines to a hyperbolic quadric in PG(3, 3). Discret. Appl. Math. 266: 121-129 (2019) - Sriparna Chattopadhyay, Kamal Lochan Patra, Binod Kumar Sahoo:
Vertex connectivity of the power graph of a finite cyclic group. Discret. Appl. Math. 266: 259-271 (2019) - Peter Dankelmann
:
On average distance in tournaments and Eulerian digraphs. Discret. Appl. Math. 266: 38-47 (2019) - Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez:
On the Fibonacci numbers of the composition of graphs. Discret. Appl. Math. 266: 213-218 (2019) - Péter L. Erdös
, Michael Ferrara, Stephen G. Hartke
:
Navigating between packings of graphic sequences. Discret. Appl. Math. 266: 252-258 (2019) - Raúl M. Falcón, Stephan Dominique Andres:
Autotopism stabilized colouring games on rook's graphs. Discret. Appl. Math. 266: 200-212 (2019) - Alexander Farrugia
:
Edge construction of molecular NSSDs. Discret. Appl. Math. 266: 130-140 (2019) - Susanna Fishel, Glenn Hurlbert
, Vikram Kamat, Karen Meagher:
Erdős-Ko-Rado theorems on the weak Bruhat lattice. Discret. Appl. Math. 266: 65-75 (2019) - Gábor Gévay:
Resolvable configurations. Discret. Appl. Math. 266: 319-330 (2019) - John L. Goldwasser, Anthony J. W. Hilton, Jie Zheng:
Several families with incomparability and complementarity conditions. Discret. Appl. Math. 266: 103-110 (2019) - Yujie Gu
, Ying Miao:
Union-intersection-bounded families and their applications. Discret. Appl. Math. 266: 346-354 (2019) - Ervin Györi, Gyula Y. Katona
, László F. Papp
:
Optimal pebbling and rubbling of graphs with given diameter. Discret. Appl. Math. 266: 340-345 (2019) - Carmen Hernando
, Mercè Mora
, Ignacio M. Pelayo:
Resolving dominating partitions in graphs. Discret. Appl. Math. 266: 237-251 (2019) - Dannielle D. D. Jin, David G. L. Wang
:
On the minimum vertex cover of generalized Petersen graphs. Discret. Appl. Math. 266: 309-318 (2019) - Josef Lauri
, Russell Mizzi, Raffaele Scapellato:
The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability. Discret. Appl. Math. 266: 85-91 (2019) - Jeanette C. McLeod, Brendan D. McKay
, Beáta Faller:
The r-switching-stable graphs. Discret. Appl. Math. 266: 16-29 (2019) - Kahina Meslem, Éric Sopena
:
On the distinguishing number of cyclic tournaments: Towards the Albertson-Collins Conjecture. Discret. Appl. Math. 266: 219-236 (2019) - Joice S. do Nascimento
, Maria Aguieiras A. de Freitas
, Renata R. Del-Vecchio
:
The distance matrix of caterpillar. Discret. Appl. Math. 266: 141-152 (2019) - Elif Saygi
, Ömer Egecioglu:
Boundary enumerator polynomial of hypercubes in Fibonacci cubes. Discret. Appl. Math. 266: 191-199 (2019)
skipping 5 more matches
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-26 23:50 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