Остановите войну!
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 36 matches
- 2023
- Marién Abreu, John Baptist Gauci, Domenico Labbate, Federico Romaniello, Jean Paul Zerafa:
Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs. Ars Math. Contemp. 23(3) (2023) - Seyed Hassan Alavi, Ashraf Daneshkhah, Fatemeh Mouseli:
Almost simple groups as flag-transitive automorphism groups of symmetric designs with λ prime. Ars Math. Contemp. 23(4) (2023) - Neal Bushaw, Blake Conka, Vinay Gupta, Aidan Kierans, Hudson Lafayette, Craig E. Larson, Kevin McCall, Andriy Mulyar, Christine Sullivan, Scott Taylor, Evan Wainright, Evan Wilson, Guanyu Wu, Sarah Loeb:
Bootstrap percolation via automated conjecturing. Ars Math. Contemp. 23(3) (2023) - Jianji Cao, Young Soo Kwon, Mimi Zhang:
A classification of connected cubic vertex-transitive bi-Cayley graphs over semidihedral group. Ars Math. Contemp. 23(4) (2023) - Shaofei Du, Yao Tian, Hao Yu:
Hamilton cycles in primitive graphs of order 2rs. Ars Math. Contemp. 23(3) (2023) - Rigoberto Flórez, José Luis Ramírez:
Enumerating symmetric pyramids in Motzkin paths. Ars Math. Contemp. 23(4) (2023) - Stefan Hammer:
Comparing Wiener, Szeged and revised Szeged index on cactus graphs. Ars Math. Contemp. 23(3) (2023) - Allen Herman, Roghayeh Maleki:
The search for small association schemes with noncyclotomic eigenvalues. Ars Math. Contemp. 23(3) (2023) - Xiaohui Hua, Lulu Yang:
Component (edge) connectivity of pancake graphs. Ars Math. Contemp. 23(3) (2023) - Vesna Irsic, Marusa Lekse, Mihael Pacnik, Petra Podlogar, Martin Pracek:
Domination and independence number of large 2-crossing-critical graphs. Ars Math. Contemp. 23(4) (2023) - György Kiss, Stefko Miklavic, Tamás Szonyi:
On girth-biregular graphs. Ars Math. Contemp. 23(4) (2023) - Teeradej Kittipassorn, Panon Sinsap:
On the existence of zero-sum perfect matchings of complete graphs. Ars Math. Contemp. 23(3) (2023) - Karen Meagher, Mahsa N. Shirazi, Brett Stevens:
An extension of the Erdős-Ko-Rado theorem to uniform set partitions. Ars Math. Contemp. 23(4) (2023) - Tahir Shamsher, Shariefuddin Pirzada, Mushtaq A. Bhat:
On adjacency and Laplacian cospectral non-isomorphic signed graphs. Ars Math. Contemp. 23(3) (2023) - Marcin Stawiski:
The role of the Axiom of Choice in proper and distinguishing colourings. Ars Math. Contemp. 23(3) (2023) - Francesa Dalla Volta, Andrea Lucchini:
The A-Möbius function of a finite group. Ars Math. Contemp. 23(3) (2023) - 2022
- Abdollah Alhevaz, Maryam Baghipur, Hilal Ahmad Ganie, Kinkar Chandra Das:
On the Aα-spectral radius of connected graphs. Ars Math. Contemp. 23(1) (2022) - Francesco Belardo, Zoran Stanic, Tomas Zaslavsky:
Total graph of a signed graph. Ars Math. Contemp. 23(1) (2022) - Hans U. Boden, Matthew Shimoda:
Braid representatives minimizing the number of simple walks. Ars Math. Contemp. 23(1) (2022) - Andrea C. Burgess, Nicholas J. Cavenagh, David A. Pike:
Mutually orthogonal cycle systems. Ars Math. Contemp. 23(2) (2022) - Andrea Caggegi:
A new family of additive designs. Ars Math. Contemp. 23(2) (2022) - Marija Dodig, Marko Stosic:
Double generalized majorization and diagrammatics. Ars Math. Contemp. 23(2) (2022) - Michael Giudici, Eric Swartz:
Locally s-arc-transitive graphs arising from product action. Ars Math. Contemp. 23(2) (2022) - Frank Göring, Martin Winter:
The edge-transitive polytopes that are not vertex-transitive. Ars Math. Contemp. 23(2) (2022) - Xin He, Heping Zhang:
Complete forcing numbers of graphs. Ars Math. Contemp. 23(2) (2022) - Máté Kadlicskó, Zsolt Lángi:
On generalized Minkowski arrangements. Ars Math. Contemp. 23(1) (2022) - Aleksander Kelenc, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero:
On metric dimensions of hypercubes. Ars Math. Contemp. 23(2) (2022) - Jurij Kovic, Tomaz Pisanski, Sara Sabrina Zemljic, Arjana Zitnik:
The Sierpiński product of graphs. Ars Math. Contemp. 23(1) (2022) - Alexander D. Mednykh, Ilya A. Mednykh:
Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics. Ars Math. Contemp. 23(1) (2022) - Seyed Morteza Mirafzal:
Some remarks on the square graph of the hypercube. Ars Math. Contemp. 23(2) (2022)
skipping 6 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-05-21 21:44 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