![](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 144 matches
- 2023
- Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shalet Thottungal Joseph:
Center and periphery of lexicographic product of digraphs. Art Discret. Appl. Math. 6(3): 3 (2023) - Sela Fried, Toufik Mansour:
Graph labelings obtainable by random walks. Art Discret. Appl. Math. 7(1): 1 (2023) - Mirko Hornák
:
On the achromatic number of the Cartesian product of two complete graphs. Art Discret. Appl. Math. 7(1): 1 (2023) - Aleksander Kelenc, Iztok Peterin
:
Distance formula for direct-co-direct product in the case of disconnected factors. Art Discret. Appl. Math. 6(2): 2 (2023) - Martin Knor, Riste Skrekovski:
On maximum Wiener index of directed grids. Art Discret. Appl. Math. 6(3): 3 (2023) - Vladimir P. Korzhik:
All 2-planar graphs having the same spanning subgraph. Art Discret. Appl. Math. 7(1): 1 (2023) - Toufik Mansour:
The length of the initial longest increasing sequence in a permutation. Art Discret. Appl. Math. 6(3): 3 (2023) - Toufik Mansour, Mark Shattuck:
Counting occurrences of subword patterns in non-crossing partitions. Art Discret. Appl. Math. 6(3): 3 (2023) - Seyed Morteza Mirafzal:
On the automorphism groups of us-Cayley graphs. Art Discret. Appl. Math. 7(1): 1 (2023) - Dave Witte Morris:
Automorphisms of the canonical double cover of a toroidal grid. Art Discret. Appl. Math. 6(3): 3 (2023) - Joy Morris, Adrian Skelton:
Cayley graphs on abelian and generalized dihedral groups. Art Discret. Appl. Math. 6(3): 3 (2023) - Jaroslav Nesetril, Ales Pultr:
Note on strong product graph dimension. Art Discret. Appl. Math. 6(2): 2 (2023) - Marko Orel
:
The core of a vertex transitive complementary prism of a lexicographic product. Art Discret. Appl. Math. 6(3): 3 (2023) - Marco Pavone:
A visual representation of the Steiner triple systems of order 13. Art Discret. Appl. Math. 6(3): 3 (2023) - Helmut Prodinger:
Skew Dyck paths without up-down-left. Art Discret. Appl. Math. 7(1): 1 (2023) - Yaser Rowshan, Mostafa Gholami:
Multipartite Ramsey number of complete graphs versus matchings. Art Discret. Appl. Math. 7(1): 1 (2023) - Michal Stas, Mária Svecová:
Disconnected spanning subgraphs of paths in the join products with cycles. Art Discret. Appl. Math. 6(3): 3 (2023) - 2022
- Haneen Al-Janabi, Gábor Bacsó:
Chromatic uniqueness of zero-divisor graphs. Art Discret. Appl. Math. 6(1): 1 (2022) - Saeid Alikhani, Nima Ghanbari, Samaneh Soltani:
Total dominator chromatic number of k-subdivision of graphs. Art Discret. Appl. Math. 6(1): 1 (2022) - Saeid Alikhani, Mohammad Hadi Shekarriz:
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring. Art Discret. Appl. Math. 6(2): 2 (2022) - Lorenzo Sauras Altuzarra
:
Some properties of the factors of Fermat numbers. Art Discret. Appl. Math. 6(2): 2 (2022) - Harinaivo Andriatahiny:
On algebraic structure of the Reed-Muller codes. Art Discret. Appl. Math. 5(2) (2022) - Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari:
A tight relation between series-parallel graphs and bipartite distance hereditary graphs. Art Discret. Appl. Math. 5(1) (2022) - Anahy Santiago Arguello, Peter F. Stadler
:
Whitney's connectivity inequalities for directed hypergraphs. Art Discret. Appl. Math. 5(1) (2022) - Daniil Baldouski
:
Product irregularity strength of graphs with small clique cover number. Art Discret. Appl. Math. 5(1) (2022) - Nino Basic, Martin Knor, Riste Skrekovski:
On 12-regular nut graphs. Art Discret. Appl. Math. 5(2) (2022) - Robert A. Beeler, Rodney Keaton, Frederick Norwood:
Deterministic bootstrap percolation on trees. Art Discret. Appl. Math. 5(2) (2022) - Jürgen Bokowski, Jörg Wills:
Regular Leonardo polyhedra: Mathematics and art. Art Discret. Appl. Math. 5(3) (2022) - Debra L. Boutin:
Paint cost and the frugal distinguishing number. Art Discret. Appl. Math. 6(2): 2 (2022) - Debra L. Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, Puck Rombach:
Symmetry parameters of various hypercube families. Art Discret. Appl. Math. 6(2): 2 (2022)
skipping 114 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-18 03:56 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