Остановите войну!
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 43 matches
- 2019
- Milad Ahanjideh, Ali Iranmanesh:
The validity of Tutte's 3-flow conjecture for some Cayley graphs. Ars Math. Contemp. 16(1): 203-213 (2019) - Julian A. Allagan, Vitaly I. Voloshin:
ℱ-WORM colorings of some 2-trees: partition vectors. Ars Math. Contemp. 16(1): 173-182 (2019) - Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk:
Weight choosability of oriented hypergraphs. Ars Math. Contemp. 16(1): 111-117 (2019) - Gabriela Araujo-Pardo, György Kiss, Christian Rubio-Montiel, Adrián Vázquez-Ávila:
On chromatic indices of finite affine spaces. Ars Math. Contemp. 16(1): 67-79 (2019) - Catarina P. Avelino, Altino F. Santos:
S2 coverings by isosceles and scalene triangles - adjacency case I. Ars Math. Contemp. 16(2): 419-443 (2019) - János Barát, Zoltán Lóránt Nagy:
Transversals in generalized Latin squares. Ars Math. Contemp. 16(1): 39-47 (2019) - Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, Matteo Silimbani:
Ascending runs in permutations and valued Dyck paths. Ars Math. Contemp. 16(2): 445-463 (2019) - Nino Basic, Jan Groselj, Branko Grünbaum, Tomaz Pisanski:
Splittable and unsplittable graphs and configurations. Ars Math. Contemp. 16(1): 1-17 (2019) - Alan F. Beardon, Juan Alberto Rodríguez-Velázquez:
On the k-metric dimension of metric spaces. Ars Math. Contemp. 16(1): 25-38 (2019) - Csilla Bujtás, Marko Jakovac:
Relating the total domination number and the annihilation number of cactus graphs and block graphs. Ars Math. Contemp. 16(1): 183-202 (2019) - Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky:
A q-queens problem. VI. The bishops' period. Ars Math. Contemp. 16(2): 549-561 (2019) - Nina Chiarelli, Martin Milanic:
Linear separation of connected dominating sets in graphs. Ars Math. Contemp. 16(2): 487-525 (2019) - Sylwia Cichacz:
Corrigendum to: On zero sum-partition of Abelian groups into three sets and group distance magic labeling. Ars Math. Contemp. 16(2): 641 (2019) - Marston D. E. Conder, Asia Ivic Weiss, Aleksander Malnic:
Petra Šparl Award 2020: Call for Nominations. Ars Math. Contemp. 16(2) (2019) - Henrique F. da Cruz, Ilda Inácio Rodrigues, Rogério Pedro Serôdio:
Convertible subspaces that arise from different numberings of the vertices of a graph. Ars Math. Contemp. 16(2): 473-486 (2019) - Bence Csajbók, Giuseppe Marino, Olga Polverino:
A Carlitz type result for linearized polynomials. Ars Math. Contemp. 16(2): 585-608 (2019) - Giovanni Lo Faro, Antoinette Tripodi:
The Doyen-Wilson theorem for 3-sun systems. Ars Math. Contemp. 16(1): 119-139 (2019) - Alessandro Fonda:
A generalization of the parallelogram law to higher dimensions. Ars Math. Contemp. 16(2): 411-417 (2019) - Jay Fraser, Olivia Jeans, Jozef Sirán:
Regular self-dual and self-Petrie-dual maps of arbitrary valency. Ars Math. Contemp. 16(2): 403-410 (2019) - Stephen P. Glasby, Cheryl E. Praeger:
On the parameters of intertwining codes. Ars Math. Contemp. 16(1): 49-58 (2019) - Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. 16(2): 277-298 (2019) - Xia Guo, Yan Yang:
A note on the 4-girth-thickness of Kn, n, n. Ars Math. Contemp. 16(1): 19-24 (2019) - Lajos Gyõrffy, Géza Makay, András Pluhár:
The pairing strategies of the 9-in-a-row game. Ars Math. Contemp. 16(1): 97-109 (2019) - Michael A. Henning, Iztok Peterin:
A characterization of graphs with disjoint total dominating sets. Ars Math. Contemp. 16(2): 359-375 (2019) - Takayuki Hibi, Nan Li, Teresa Xueshan Li, Li Li Mu, Akiyoshi Tsuchiya:
Order-chain polytopes. Ars Math. Contemp. 16(2): 299-317 (2019) - Laiachi El Kaoutit, Paolo Saracco:
Comparing topologies on linearly recursive sequences. Ars Math. Contemp. 16(2): 319-329 (2019) - Gábor Korchmáros, Alessandro Siciliano:
Embedding of orthogonal Buekenhout-Metz unitals in the Desarguesian plane of order q2. Ars Math. Contemp. 16(2): 609-623 (2019) - Jurij Kovic:
Regular polygonal systems. Ars Math. Contemp. 16(1): 157-171 (2019) - Klavdija Kutnar, Dragan Marusic, Tomaz Pisanski:
Plan S - A Golden Addition to the Diamond Open Access Publishing Model. Ars Math. Contemp. 16(1) (2019) - Jin Ho Kwak, Young Soo Kwon:
Classification of some reflexible edge-transitive embeddings of complete bipartite graphs. Ars Math. Contemp. 16(2): 563-583 (2019)
skipping 13 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-06-30 05:40 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