Остановите войну!
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 40 matches
- 2016
- Jessie Abraham, Micheal Arockiaraj:
Wirelength of Enhanced Hypercubes into r-Rooted Complete Binary Trees. Electron. Notes Discret. Math. 53: 373-382 (2016) - R. Alagammai, V. Vijayalakshmi:
Game Chromatic Number of Direct Product of Some Families of Graphs. Electron. Notes Discret. Math. 53: 355-362 (2016) - Salem A. Alyami, A. K. M. Azad, Jonathan M. Keith:
Uniform Sampling of Directed and Undirected Graphs Conditional on Vertex Connectivity. Electron. Notes Discret. Math. 53: 43-55 (2016) - S. Arumugam, Purnima Gupta, Rajesh Singh:
Bounds on Graphoidal Length of a Graph. Electron. Notes Discret. Math. 53: 113-122 (2016) - S. Arumugam, J. Saral, A. Somasundaram:
Minimizing the Number of Exceptional Edges in Cellular Manufacturing Problem. Electron. Notes Discret. Math. 53: 465-472 (2016) - K. Dhanalakshmi, J. Amalorpava Jerline, L. Benedict Michaelraj:
Dichromatic Polynomial of Product Digraphs. Electron. Notes Discret. Math. 53: 165-172 (2016) - S. Dhanalakshmi, N. Sadagopan, V. Manogna:
Tri-connectivity Augmentation in Trees. Electron. Notes Discret. Math. 53: 57-72 (2016) - A. Tamil Elakkiya, Appu Muthusamy:
Gregarious Kite Decomposition of Tensor Product of Complete Graphs. Electron. Notes Discret. Math. 53: 83-96 (2016) - P. Francis, S. Francis Raj:
The b-chromatic number of powers of hypercube. Electron. Notes Discret. Math. 53: 459-464 (2016) - J. Geetha, K. Somasundaram:
Total Chromatic Number and Some Topological Indices. Electron. Notes Discret. Math. 53: 363-371 (2016) - Purnima Gupta, Deepti Jain:
Global 2-Point Set Domination Number of a Graph. Electron. Notes Discret. Math. 53: 213-224 (2016) - Raibatak Sen Gupta, Malay K. Sen:
Some new results on the graph Γ1(R) over a ring R. Electron. Notes Discret. Math. 53: 3-14 (2016) - Purnima Gupta, Rajesh Singh:
Domination in Graphoidally Covered Graphs: Least-Kernel Graphoidal Covers. Electron. Notes Discret. Math. 53: 433-444 (2016) - Jochen Harant, Arnfried Kemnitz:
Lower bounds on the sum choice number of a graph. Electron. Notes Discret. Math. 53: 421-431 (2016) - Suresh Manjanath Hegde, Kumudakshi:
Further Results on Graceful Directed Graphs. Electron. Notes Discret. Math. 53: 149-154 (2016) - Andreas M. Hinz, S. Arumugam, Rangaswami Balakrishnan, S. Francis Raj, T. Karthick, K. Somasundaram, Xuding Zhu:
Preface. Electron. Notes Discret. Math. 53: 1-2 (2016) - Andreas M. Hinz, Ciril Petr:
Computational Solution of an Old Tower of Hanoi Problem. Electron. Notes Discret. Math. 53: 445-458 (2016) - J. Amalorpava Jerline, K. Dhanalakshmi, L. Benedict Michaelraj:
The first and the second Zagreb indices of the generalized Mycielskian of graphs. Electron. Notes Discret. Math. 53: 239-258 (2016) - Divya K, Amal P. M, Ajish Kumar K. S:
A degree based approach to find Steiner Trees. Electron. Notes Discret. Math. 53: 383-393 (2016) - Anjeneya Swami Kare:
A Simple Algorithm For Replacement Paths Problem. Electron. Notes Discret. Math. 53: 307-318 (2016) - T. Karthick:
Star chromatic bounds. Electron. Notes Discret. Math. 53: 413-419 (2016) - K. Kayathri, R. Amutha:
Edge-Graceful Labelings of Connected Graphs. Electron. Notes Discret. Math. 53: 287-296 (2016) - Amal P. M, Ajish Kumar K. S:
An Algorithm for kth Minimum Spanning Tree. Electron. Notes Discret. Math. 53: 343-354 (2016) - K. N. Meera, B. Sooryanarayana:
Radio Secure number of a Graph. Electron. Notes Discret. Math. 53: 271-286 (2016) - S. Mohan, J. Geetha, K. Somasundaram:
Total Coloring of Certain Classes of Product Graphs. Electron. Notes Discret. Math. 53: 173-180 (2016) - Hiranmoy Pal, Bikash Bhattacharjya:
A class of gcd-graphs having Perfect State Transfer. Electron. Notes Discret. Math. 53: 319-329 (2016) - K. Pattabiraman, P. Kandan:
On Weighted PI Index of Graphs. Electron. Notes Discret. Math. 53: 225-238 (2016) - K. Pattabiraman, M. Vijayaragavan:
Reformulated Reciprocal Degree Distance of Transformation Graph. Electron. Notes Discret. Math. 53: 259-270 (2016) - Kavita Pradeep, V. Vijayalakshmi:
Star Chromatic Index of Subcubic Graphs. Electron. Notes Discret. Math. 53: 155-164 (2016) - P. Roushini Leely Pushpam, K. Priya Bhanthavi:
The Independent Transversal Dombondage Number of a Graph. Electron. Notes Discret. Math. 53: 199-211 (2016)
skipping 10 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-25 11:13 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