Остановите войну!
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 31 matches
- 2017
- Bart De Bruyn:
On some 2-tight sets of polar spaces. Ars Comb. 133: 115-131 (2017) - Fuyuan Chen:
A relationship between Minors and Linkages. Ars Comb. 133: 317-327 (2017) - Dafik, Slamin, Dushyant Tanna, Andrea Semanicová-Fenovcíková, Martin Baca:
Constructions Of H-Antimagic Graphs Using Smaller Edge-Antimagic Graphs. Ars Comb. 133: 233-245 (2017) - Gideon Dror, Arieh Lev, Yehuda Roditty, Romina Zigdon:
On the rainbow connection number of graphs. Ars Comb. 133: 51-67 (2017) - Yunshu Gao, Lingxiu Wu:
The Extremal Function for Three Disjoint Theta Graphs. Ars Comb. 133: 37-49 (2017) - Zhen-Mu Hong, Xinmin Hou, Jiaao Li, Yang Yang:
A note on broom number and maximum edge-cut of graphs. Ars Comb. 133: 341-347 (2017) - R. Lakshmi, G. Rajasekaran, R. Sampathkumar:
On Lower Orientable Strong Diameter And Strong Radius Of Some Graphs. Ars Comb. 133: 385-400 (2017) - Yantao Li, Hui-Wen Cheng, Qing-Hua Ma:
A note on non-existence of cubic semisymmetric graphs of order 8p or 8p2. Ars Comb. 133: 377-383 (2017) - Xiuli Li, Tan Mingming:
Skew-quasi-cyclic codes over Ml(Fq)[X, θ]. Ars Comb. 133: 163-177 (2017) - Wensheng Li, Huaming Xing, Zhongsheng Huang:
Paired domination number of generalized Petersen graphs P(n, 2). Ars Comb. 133: 147-154 (2017) - Dingjun Lou:
A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs. Ars Comb. 133: 69-92 (2017) - Pengli Lu, Yang Yang:
Generalized characteristic polynomial of generalized R-vertex corona. Ars Comb. 133: 367-376 (2017) - Meijin Luo, Xi Li:
Upper bound on the primitive exponents of a class of three-colored digraphs. Ars Comb. 133: 179-195 (2017) - Haicheng Ma, Wenhua Yang, Xiafei Meng, Shenggang Li:
The characterization of graph by positive inertia index. Ars Comb. 133: 255-267 (2017) - Ali Reza Moghaddamfar, S. Rahbariyan, S. Navid Salehy, S. Nima Salehy:
The number of spanning trees of power graphs associated with specific groups and some applications. Ars Comb. 133: 269-296 (2017) - Doost Ali Mojdeh, Babak Samadi, S. M. Hosseini Moghaddam:
Limited packing vs tuple domination in graphs. Ars Comb. 133: 155-161 (2017) - Nader Jafari Rad, Akbar Jahanbani, Roslan Hasni:
Pentacyclic Graphs with Maximal Estrada Index. Ars Comb. 133: 133-145 (2017) - J. K. Sareen, M. Rana:
Four-way combinatorial interpretations of some Rogers-Ramanujan type identities. Ars Comb. 133: 17-35 (2017) - Dinesh G. Sarvate, Li Zhang:
Decompositions of λKn into LOE and OLE Graphs. Ars Comb. 133: 93-105 (2017) - M. A. Seoud, M. A. Salim:
Some results and remarks on harmonic mean and mean cordial labelings. Ars Comb. 133: 329-340 (2017) - Sezer Sorgun:
An Incomparable Upper Bound For The Largest Laplacian Graph Eigenvalue. Ars Comb. 133: 197-204 (2017) - Xun-Tuan Su:
The truncated determinants of combinatorial rectangular arrays. Ars Comb. 133: 205-216 (2017) - Hsun Su, Yuan-Kang Shih, Shih-Yan Chen, Shin-Shin Kao:
A study on degree characterization for hamiltonian-connected graphs. Ars Comb. 133: 297-316 (2017) - Elif Tan:
On Bi-Periodic Fibonacci And Lucas Numbers by Matrix Method. Ars Comb. 133: 107-113 (2017) - Yasemin Tasyurdu, Ömür Deveci:
The Fibonacci Polynomials in Rings. Ars Comb. 133: 355-366 (2017) - Li Wang:
On the Semisymmetric Graphs of Order 2p3: faithful and primitive case. Ars Comb. 133: 3-15 (2017) - Yiqiao Wang, Xiaoxue Hu, Weifan Wang:
The chromatic number of the square of a Halin graph with maximum degree five is six. Ars Comb. 133: 217-231 (2017) - Rundan Xing:
Note on the distance spectral gap of graphs. Ars Comb. 133: 247-258 (2017) - Ling Xue:
List vertex arboricity of planar graphs with 5-cycles not adjacent to 3-cycles and 4-cycles. Ars Comb. 133: 401-406 (2017) - Sheng-Liang Yang, Yan-Xue Xu, Xiao Gao:
On the half of a Riordan array. Ars Comb. 133: 407-422 (2017)
skipping 1 more match
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-04-26 10:35 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