Остановите войну!
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 37 matches
- 2016
- Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Dorota Kuziak:
Maximal 2-rainbow domination number of a graph. AKCE Int. J. Graphs Comb. 13(2): 157-164 (2016) - Abolape Deborah Akwu, Deborah Olayide A. Ajayi:
Decomposing certain equipartite graphs into sunlet graphs of length 2p. AKCE Int. J. Graphs Comb. 13(3): 267-271 (2016) - S. Arumugam, Joe Ryan, Martin Baca, Kiki Ariyanti Sugeng, S. Slamin, Bharathi Rajan, Dalibor Froncek:
In memoriam Emeritus Professor Mirka Miller 09-05-1949 : 02-01-2016. AKCE Int. J. Graphs Comb. 13(2): 210-211 (2016) - Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
A number theoretic problem on super line graphs. AKCE Int. J. Graphs Comb. 13(2): 177-190 (2016) - Ratinan Boonklurb, Authawich Narissayaporn, Sirirat Singhun:
Super edge-magic labeling of m-node k-uniform hyperpaths and m-node k-uniform hypercycles. AKCE Int. J. Graphs Comb. 13(3): 218-229 (2016) - T. Tamizh Chelvam, Thangaraj Asir:
Distances in zero-divisor and total graphs from commutative rings-A survey. AKCE Int. J. Graphs Comb. 13(3): 290-298 (2016) - Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani:
Note on vertex and total proper connection numbers. AKCE Int. J. Graphs Comb. 13(2): 103-106 (2016) - Colin Defant:
Unitary Cayley graphs of Dedekind domain quotients. AKCE Int. J. Graphs Comb. 13(1): 65-75 (2016) - L. Jones Tarcius Doss, P. Arathi:
A constructive bandwidth reduction algorithm - A variant of GPS algorithm. AKCE Int. J. Graphs Comb. 13(3): 241-254 (2016) - Dinny Fitriani, A. N. M. Salman:
Rainbow connection number of amalgamation of some graphs. AKCE Int. J. Graphs Comb. 13(1): 90-99 (2016) - Dalibor Froncek:
Alpha labelings of full hexagonal caterpillars. AKCE Int. J. Graphs Comb. 13(1): 85-89 (2016) - Hortensia Galeana-Sánchez, Rocío Sánchez-López:
H-kernels by walks in H-colored digraphs and the color-class digraph. AKCE Int. J. Graphs Comb. 13(2): 120-129 (2016) - Joseph A. Gallian, Danielle Stewart:
Corrigendum to "Properly even harmonious labelings of disconnected graphs" [AKCE Inter. J. Graphs Combin. 12 (2015) 193-203]. AKCE Int. J. Graphs Comb. 13(1): 100 (2016) - Joseph A. Gallian, Danielle Stewart:
Corrigendum to "Even harmonious labelings of disjoint graphs with a small component" [AKCE Inter. J. Graphs Combin. 12 (2015) 204-215]. AKCE Int. J. Graphs Comb. 13(1): 101 (2016) - Daphne Gold, James M. Henle, Cherry Huang, Tia Lyve, Tara Marin, Jasmine Osorio, Mäneka Puligandla, Bayla Weick, Jing Xia, He Yun, Jize Zhang:
Puzzling and apuzzling graphs. AKCE Int. J. Graphs Comb. 13(1): 1-10 (2016) - Purnima Gupta, Rajesh Singh, S. Arumugam:
Characterizing minimal point set dominating sets. AKCE Int. J. Graphs Comb. 13(3): 283-289 (2016) - Michael Haythorpe:
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem. AKCE Int. J. Graphs Comb. 13(3): 272-282 (2016) - Suresh Manjanath Hegde, Suresh Dara:
On clique convergence of graphs. AKCE Int. J. Graphs Comb. 13(3): 261-266 (2016) - Muhammad Imran, Hafiz Usman Afzal, Abdul Qudair Baig:
On super edge-magic deficiency of volvox and dumbbell graphs. AKCE Int. J. Graphs Comb. 13(2): 112-119 (2016) - Gopalapillai Indulal, R. Balakrishnan:
Distance spectrum of Indu-Bala product of graphs. AKCE Int. J. Graphs Comb. 13(3): 230-234 (2016) - Muhammad Irfan, Andrea Semanicová-Fenovcíková:
On total labelings of graphs with prescribed weights. AKCE Int. J. Graphs Comb. 13(2): 191-199 (2016) - Md. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
On some properties of doughnut graphs. AKCE Int. J. Graphs Comb. 13(2): 130-139 (2016) - Steven Klee, Hunter Lehmann, Andrew Park:
Prime labeling of families of trees with Gaussian integers. AKCE Int. J. Graphs Comb. 13(2): 165-176 (2016) - Khee Meng Koh, Kian Wee Soh:
Power domination of the cartesian product of graphs. AKCE Int. J. Graphs Comb. 13(1): 22-30 (2016) - Gee-Choon Lau, Zhen-Bin Gao, Sin-Min Lee, Guang-Yi Sun:
On friendly index sets of the edge-gluing of complete graph and cycles. AKCE Int. J. Graphs Comb. 13(2): 107-111 (2016) - Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng:
Further results on super graceful labeling of graphs. AKCE Int. J. Graphs Comb. 13(2): 200-209 (2016) - Dae-Won Lee:
Some lower and upper bounds on the third ABC index. AKCE Int. J. Graphs Comb. 13(1): 11-15 (2016) - Jia-Bao Liu, Wei Gao, Muhammad Kamran Siddiqui, Muhammad Reza Farahani:
Computing three topological indices for Titania nanotubes TiO2[m, n]. AKCE Int. J. Graphs Comb. 13(3): 255-260 (2016) - Nagarajan Paramaguru, Rathinasamy Sampathkumar:
Graphs with vertex-coloring and detectable 2-edge-weighting. AKCE Int. J. Graphs Comb. 13(2): 146-156 (2016) - Satyabrata Paul, Madhumangal Pal, Anita Pal:
A linear time algorithm to compute square of interval graphs and their colouring. AKCE Int. J. Graphs Comb. 13(1): 54-64 (2016)
skipping 7 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-12 19:09 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