![](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 30 matches
- 2018
- Horst Alzer, Helmut Prodinger:
On Ruehr's Identities. Ars Comb. 139: 247-254 (2018) - Gaixiang Cai, Miaolin Ye, Gui-Dong Yu, Lifang Ren:
Hyper-Wiener index and Hamiltonicity of graphs. Ars Comb. 139: 175-184 (2018) - C. Y. Chew, Angelina Y. M. Chin, C. S. Lim:
The number of subgroups of a direct product of cyclic p-groups. Ars Comb. 139: 353-360 (2018) - Salama Nagy Daoud:
Number of Spanning trees in Different Products of Complete and Complete Tripartite Graphs. Ars Comb. 139: 85-103 (2018) - Hanyuan Deng, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran:
Extremal Properties of Some Topological Indices of Graphs. Ars Comb. 139: 327-336 (2018) - Aijun Dong, Jianliang Wu:
Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles. Ars Comb. 139: 361-383 (2018) - Xiyuan Feng, Jianfeng Wang, Francesco Belardo:
Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2. Ars Comb. 139: 43-54 (2018) - Xianya Geng, Hongjin Zhao:
On the sum of the squares of all distances in trees with fixed diameter. Ars Comb. 139: 145-157 (2018) - Adam Gilbert, Gary Tiner:
On the Erdos-Sos Conjecture for spiders in graphs having no path with 2k+1 vertices. Ars Comb. 139: 297-313 (2018) - Vu Dinh Hoa, Moshe Rosenfeld:
A new labeling of C2n proves that K4 + M6n decomposes K6n+4. Ars Comb. 139: 255-267 (2018) - Xiao-Hui Hua, Li Chen:
One class of primitive 2-arc transitive graphs. Ars Comb. 139: 105-117 (2018) - Ionut Emil Iacob, T. Bruce McLean, Hua Wang:
About General Order Regular Flexagons. Ars Comb. 139: 159-173 (2018) - B. Krishnakumari, Yanamandram B. Venkatakrishnan, S. K. Ayyaswamy:
Cactus graphs with equal domination and complementary tree domination numbers. Ars Comb. 139: 229-235 (2018) - Yueping Li, Dingjun Lou:
Hamilton Cycles in n-Extendable Bipartite Graphs. Ars Comb. 139: 3-18 (2018) - Jing Jian Li, Bo Ling, Xiaodan Chen:
Tetravalent Normal Primitive Cayley Graphs. Ars Comb. 139: 69-83 (2018) - Changhong Lu, Rui Mao, Bing Wang:
Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four. Ars Comb. 139: 393-409 (2018) - S. Nada, Adel T. Diab, A. Elrokh, D. E. Sabra:
The corona between paths and cycles. Ars Comb. 139: 269-281 (2018) - Asim Naseem, Khurram Shabbir, Hani Shaker:
The Radio Number of Edge-Joint Graphs. Ars Comb. 139: 337-351 (2018) - Krzysztof Piejko:
On the number of (A, B, 2C)-edge colourings in graphs. Ars Comb. 139: 27-41 (2018) - Krzysztof Piejko:
On k-distance Pell numbers and ((k-1)A, (k-1)B, kC)-edge coloured graphs. Ars Comb. 139: 197-215 (2018) - Krzysztof Piejko, Lucyna Trojnar-Spelina:
On (A, 2B, 2C)-edge colouring in certain class of graphs. Ars Comb. 139: 119-131 (2018) - Jen-Ling Shang, Tay-Woei Shyu, Chiang Lin:
Weakly status injective trees are status unique in trees. Ars Comb. 139: 133-143 (2018) - Hsun Su, Hsiu-Chunj Pan, Shih-Yan Chen, Shin-Shin Kao:
On mutually independent hamiltonian cycles. Ars Comb. 139: 185-195 (2018) - Erling Wei, Jiangtao Liu, Han Ren:
Decycling Number of a class of 4-regular graphs. Ars Comb. 139: 315-326 (2018) - Denis Chee-Keong Wong:
An Exponent Bound for Abelian Group that admit a Covering Extended Building Set. Ars Comb. 139: 217-227 (2018) - Hongbing Zhang:
A sharper lower bound on the signless Laplacian Estrada index. Ars Comb. 139: 19-26 (2018) - Guanghui Zhang:
Constacyclic Codes over Fp + vFp. Ars Comb. 139: 55-67 (2018) - Xiaoling Zhang, Kecai Deng:
Distance two labelings in regular bipartite graphs. Ars Comb. 139: 283-296 (2018) - Mengen Zhang, Xia Zhang:
The correlation between the f-chromatic class and the gc-chromatic class of an (r, r+1)-graph. Ars Comb. 139: 385-392 (2018) - Xue Zhou, Shuiying Cai:
The degree sequence of the graph with cyclomatic number less than four. Ars Comb. 139: 237-246 (2018)
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-12 00:58 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