Остановите войну!
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 74 matches
- 2017
- Xueliang Li, Hengzhe Li, Yuefang Sun:
Rainbow connection number of graphs with diameter 3. Discuss. Math. Graph Theory 37(1): 141-154 (2017) - Susan A. van Aardt:
Every 8-traceable oriented graph is traceable. Discuss. Math. Graph Theory 37(4): 963-973 (2017) - Saieed Akbari, Shahab Haghi, Hamid Reza Maimani, Abbas Seify:
On double-star decomposition of graphs. Discuss. Math. Graph Theory 37(3): 835-840 (2017) - Jesús Alva-Samos, Juan José Montellano-Ballesteros:
Rainbow connectivity of cacti and some infinite digraphs. Discuss. Math. Graph Theory 37(2): 301-313 (2017) - José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Relating 2-rainbow domination to Roman domination. Discuss. Math. Graph Theory 37(4): 953-961 (2017) - Sarah E. Anderson, Yaoqi Guo, Asa Tenney, Kirsti Wash:
Prime factorization and domination in the hierarchical product of graphs. Discuss. Math. Graph Theory 37(4): 873-890 (2017) - Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami:
Signed total Roman edge domination in graphs. Discuss. Math. Graph Theory 37(4): 1039-1053 (2017) - Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed Roman edge k-domination in graphs. Discuss. Math. Graph Theory 37(1): 39-53 (2017) - Faraha Ashraf, Martin Baca, Marcela Lascsáková, Andrea Semanicová-Fenovcíková:
On H-irregularity strength of graphs. Discuss. Math. Graph Theory 37(4): 1067-1078 (2017) - Maryam Atapour, Nasrin Dehgardi:
Twin minus total domination numbers in directed graphs. Discuss. Math. Graph Theory 37(4): 989-1004 (2017) - Bhagyashree Y. Bam, Charusheela M. Deshpande, Lata N. Kamble:
Almost self-complementary 3-uniform hypergraphs. Discuss. Math. Graph Theory 37(1): 131-140 (2017) - Ravindra B. Bapat, Masoud Karimi:
Construction of cospectral integral regular graphs. Discuss. Math. Graph Theory 37(3): 595-609 (2017) - Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak:
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37(1): 89-115 (2017) - Houmem Belkhechine, Pierre Ille, Robert E. Woodrow:
Criticality of switching classes of reversible 2-structures labeled by an Abelian group. Discuss. Math. Graph Theory 37(1): 175-209 (2017) - Julien Bensmail:
On q-power cycles in cubic graphs. Discuss. Math. Graph Theory 37(1): 211-220 (2017) - Oleg V. Borodin, Anna O. Ivanova:
All tight descriptions of 3-stars in 3-polytopes with girth 5. Discuss. Math. Graph Theory 37(1): 5-12 (2017) - Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt:
Forbidden structures for planar perfect consecutively colourable graphs. Discuss. Math. Graph Theory 37(2): 315-336 (2017) - Isma Bouchemakh, Laïche Daouya, Éric Sopena:
Packing coloring of some undirected and oriented coronae graphs. Discuss. Math. Graph Theory 37(3): 665-690 (2017) - Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
On sequential heurestic methods for the maximum independent set problem. Discuss. Math. Graph Theory 37(2): 415-426 (2017) - Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj:
How long can one bluff in the domination game?. Discuss. Math. Graph Theory 37(2): 337-352 (2017) - Walter Carballosa, Ruy Fabila Monroy, Jesús Leaños, Luis Manuel Rivera-Martínez:
Regularity and planarity of token graphs. Discuss. Math. Graph Theory 37(3): 573-586 (2017) - Gary Chartrand, Sean English, Ping Zhang:
Kaleidoscopic colorings of graphs. Discuss. Math. Graph Theory 37(3): 711-727 (2017) - Yichao Chen, Yan Yang:
The thickness of amalgamations and Cartesian product of graphs. Discuss. Math. Graph Theory 37(3): 561-572 (2017) - Sylwia Cichacz, Mateusz Nikodem:
Union of distance magic graphs. Discuss. Math. Graph Theory 37(1): 239-249 (2017) - Charles B. Crane:
Forbidden pairs and (k, m)-pancyclicity. Discuss. Math. Graph Theory 37(3): 649-663 (2017) - Július Czap, Stanislav Jendrol', Juraj Valiska:
WORM colorings of planar graphs. Discuss. Math. Graph Theory 37(2): 353-368 (2017) - Peter Dankelmann, Elizabeth Jonck, Tomás Vetrík:
The degree-diameter problem for outerplanar graphs. Discuss. Math. Graph Theory 37(3): 823-834 (2017) - Kecai Deng, Xiaoling Zhang:
Characterization results for L(2, 1, 1)-labeling problem on trees. Discuss. Math. Graph Theory 37(3): 611-622 (2017) - Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 37(2): 299-299 (2017) - Éric Duchêne, Hamamache Kheddouci, Mohammed Amin Tahraoui, Mariusz Wozniak:
Labeled embedding of (n, n-2)-graphs in their complements. Discuss. Math. Graph Theory 37(4): 1015-1025 (2017)
skipping 44 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-24 04:36 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