Остановите войну!
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 63 matches
- 2012
- Ali Ahmad, Edy Tri Baskoro, Muhammad Imran:
Total vertex irregularity strength of disjoint union of Helm graphs. Discuss. Math. Graph Theory 32(3): 427-434 (2012) - S. Arockiaraj, Kumarappan Kathiresan:
p-Wiener intervals and p-Wiener free intervals. Discuss. Math. Graph Theory 32(1): 121-127 (2012) - S. Arumugam, Kalimuthu Karuppasamy, Varughese Mathew:
Fractional distance domination in graphs. Discuss. Math. Graph Theory 32(3): 449-459 (2012) - Thangaraj Asir, T. Tamizh Chelvam:
Intersection graph of gamma sets in the total graph. Discuss. Math. Graph Theory 32(2): 341-356 (2012) - Mohammed S. A. Bataineh, Mohammed M. M. Jaradat:
Edge maximal C2k+1-edge disjoint free graphs. Discuss. Math. Graph Theory 32(2): 271-278 (2012) - Stephen Benecke, Christina M. Mynhardt:
Characterizing Cartesian fixers and multipliers. Discuss. Math. Graph Theory 32(1): 161-175 (2012) - L'udmila Bezegová, Jaroslav Ivanco:
A characterization of complete tripartite degree-magic graphs. Discuss. Math. Graph Theory 32(2): 243-253 (2012) - Allan Bickle:
Structural results on maximal k-degenerate graphs. Discuss. Math. Graph Theory 32(4): 659-676 (2012) - Oleg V. Borodin, Anna O. Ivanova:
2-distance 4-colorability of planar subcubic graphs with girth at least 22. Discuss. Math. Graph Theory 32(1): 141-151 (2012) - José Cáceres, Ortrud R. Oellermann, María Luz Puertas:
Minimal trees and monophonic convexity. Discuss. Math. Graph Theory 32(4): 685-704 (2012) - Mustapha Chellali, Soufiane Khelifi:
Double domination critical and stable graphs upon vertex removal. Discuss. Math. Graph Theory 32(4): 643-657 (2012) - Mustapha Chellali, Nacéra Meddah:
Trees with equal 2-domination and 2-independence numbers. Discuss. Math. Graph Theory 32(2): 263-270 (2012) - Mustapha Chellali, Hocine Boumediene Merouane:
On the dominator colorings in trees. Discuss. Math. Graph Theory 32(4): 677-683 (2012) - Hong-Yu Chen, Xue-Gang Chen, Wai Chee Shiu, Pak Kiu Sun:
On the total restrained domination number of direct products of graphs. Discuss. Math. Graph Theory 32(4): 629-641 (2012) - Andrey A. Dobrynin, Leonid S. Melnikov:
4-chromatic Koester graphs. Discuss. Math. Graph Theory 32(4): 617-627 (2012) - Ardeshir Dolati, Somayyeh Golalizadeh:
Sharp bounds for the number of matchings in generalized-theta-graphs. Discuss. Math. Graph Theory 32(4): 771-782 (2012) - Michael Dorfling, Samantha Dorfling:
Recognizable colorings of cycles and trees. Discuss. Math. Graph Theory 32(1): 81-90 (2012) - Linda Eroh, Ralucca Gera, Cong X. Kang, Craig E. Larson, Eunjeong Yi:
Domination in functigraphs. Discuss. Math. Graph Theory 32(2): 299-319 (2012) - Gilbert Eyabi, Jobby Jacob, Renu C. Laskar, Darren A. Narayan, Dan Pillone:
Minimal rankings of the Cartesian product Kn\Box Km. Discuss. Math. Graph Theory 32(4): 725-735 (2012) - Futaba Fujie-Okamoto, Kyle Kolasinski, Jianwei Lin, Ping Zhang:
Vertex rainbow colorings of graphs. Discuss. Math. Graph Theory 32(1): 63-80 (2012) - Dániel Gerbner, Balázs Keszegh, Cory Palmer:
Generalizations of the tree packing conjecture. Discuss. Math. Graph Theory 32(3): 569-582 (2012) - K. Augustine Germina, Koombail Shahul Hameed:
On composition of signed graphs. Discuss. Math. Graph Theory 32(3): 507-516 (2012) - Wayne Goddard, Honghai Xu:
The S-packing chromatic number of a graph. Discuss. Math. Graph Theory 32(4): 795-806 (2012) - Przemyslaw Gordinowicz, Pawel Pralat:
The first player wins the one-colour triangle avoidance game on 16 vertices. Discuss. Math. Graph Theory 32(1): 181-185 (2012) - Petr Gregor, Riste Skrekovski:
Parity vertex colorings of binomial trees. Discuss. Math. Graph Theory 32(1): 177-180 (2012) - Mohammad Hailat:
On generalization of the friendship theorem. Discuss. Math. Graph Theory 32(1): 153-160 (2012) - Mariusz Haluszczak:
On Ramsey (K1, 2, Kn)-minimal graphs. Discuss. Math. Graph Theory 32(2): 331-339 (2012) - Ismail Sahul Hamid:
Independent transversal domination in graphs. Discuss. Math. Graph Theory 32(1): 5-17 (2012) - César Hernández-Cruz:
3-transitive digraphs. Discuss. Math. Graph Theory 32(2): 205-219 (2012) - Pak Tung Ho:
The projective plane crossing number of the circulant graph C(3k;{1, k}). Discuss. Math. Graph Theory 32(1): 91-108 (2012)
skipping 33 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-04-25 13:11 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