Остановите войну!
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 44 matches
- 2012
- Ali Ahmad, Muhammad Kamran Siddiqui, Muhammad Faisal Nadeem, Muhammad Imran:
On super edge magic deficiency of kite graphs. Ars Comb. 107: 201-208 (2012) - M. Ali, Muhammad Tariq Rahim, Gohar Ali, Muhammad Farooq:
An upper bound for the radio number of generalized gear graph. Ars Comb. 107: 161-168 (2012) - Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni:
Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs. Ars Comb. 107: 109-127 (2012) - Hong Bian, Xiaoling Ma, Elkin Vumar, Haizheng Yu:
The Wiener-type indices of the corona of two graphs. Ars Comb. 107: 193-199 (2012) - Ryan C. Bunge, Saad I. El-Zanati, W. O'Hanlon, Charles Vanden Eynden:
On γ-labeling the almost-bipartite graph Pm+e. Ars Comb. 107: 65-80 (2012) - Huiping Cai, Juan Liu, Jixiang Meng:
Domination number in iterated line digraph of a complete bipartite digraph. Ars Comb. 107: 515-520 (2012) - Irène Charon, Olivier Hudry, Antoine Lobstein:
Extremal Values for the Maximum Degree in a Twin-Free Graph. Ars Comb. 107: 257-274 (2012) - Gang Chen, Jian-Hua Yin, Ze-Tu Gao:
The Graham's pebbling conjecture for K-k1r, s x K-k2m, n. Ars Comb. 107: 97-108 (2012) - Chengye Zhao, Feilong Cao:
The Diameter of Connected Domination Critical Graphs. Ars Comb. 107: 537-541 (2012) - Chengye Zhao, Yuansheng Yang, Linlin Sun:
Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs. Ars Comb. 107: 177-192 (2012) - YoungJu Choie, Steven T. Dougherty, Hongwei Liu:
Jacobi Forms and Hilbert-Siegel Modular Forms over Totally Real Fields and Self-Dual Codes over Polynomial Rings Z2m[x] / <g(x)>. Ars Comb. 107: 141-160 (2012) - Huawei Dai, Junqing Cai:
An implicit degree Dirac condition for hamiltonian cycles. Ars Comb. 107: 445-453 (2012) - Chandra Dinavahi, C. A. Rodger:
Path Decompositions Which Contain No Proper Subsystems. Ars Comb. 107: 33-49 (2012) - Rolito G. Eballe, Rodelito Aldema, Esamel M. Paluga, Ricky F. Rulete, Ferdinand P. Jamil:
Global Defensive Alliances in the Join, Corona and Composition of Graphs. Ars Comb. 107: 225-245 (2012) - You Gao, Liwei Chang:
A New Construction of Authentication Code with Arbitration from (2v+2+ℓ)-dimensional Singular Pseudo-Symplectic Space. Ars Comb. 107: 247-256 (2012) - Guohui Hao:
Large sets of K2, 2-decomposition of complete bipartite graphs. Ars Comb. 107: 353-360 (2012) - Guohui Hao, Qingde Kang:
Large sets of λ-fold K1, 3-factors of complete bipartite graphs. Ars Comb. 107: 465-472 (2012) - Abbas Heydari, Bijan Taeri:
An operation based on complete graphs with an application to the line graphs of trees. Ars Comb. 107: 275-288 (2012) - Ziwen Huang, Hanyuan Deng, Shubo Chen:
A sharp lower bound of index of the cacti with perfect matchings. Ars Comb. 107: 17-32 (2012) - Danjun Huang, Weifan Wang, Jianxing Yin:
A Note on General Neighbor-Distinguishing Total Coloring of Graphs. Ars Comb. 107: 379-384 (2012) - Ramin Javadi, Behnaz Omoomi:
On b-coloring of cartesian product of graphs. Ars Comb. 107: 521-536 (2012) - Taekyun Kim, Dae San Kim, Abdelmejid Bayad, Seog-Hoon Rim:
Identities On The Bernoulli And The Euler Numbers And Polynomials. Ars Comb. 107: 455-463 (2012) - Taekyun Kim, B. Lee, S. H. Lee, Seog-Hoon Rim:
Identities For The Bernoulli And Euler Numbers And Polynomials. Ars Comb. 107: 325-337 (2012) - William Klostermeyer, Christina M. Mynhardt:
Eternal Total Domination in Graphs. Ars Comb. 107: 473-492 (2012) - Sin-Min Lee:
On Constructions which yield Fully Magic Graphs. Ars Comb. 107: 385-409 (2012) - Xiaoxia Lin, Xiaofeng Guo:
Hosoya polynomials of the capped zig-zag nanotubes. Ars Comb. 107: 81-96 (2012) - Xuemei Liu, Yu-Ting Xiao, You Gao:
Lattices generated by orbits of flats under finite affine-singular symplectic groups. Ars Comb. 107: 3-15 (2012) - M. Mansour, M. A. Obaid:
On a new Stirling's series. Ars Comb. 107: 411-418 (2012) - Sükrü Olgun, Mustafa Saltan:
On Some Finite Hyperbolic Spaces. Ars Comb. 107: 317-324 (2012) - Tahsin Oner:
Infinite Symmetric Groups. Ars Comb. 107: 129-140 (2012)
skipping 14 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-07 13:18 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