Остановите войну!
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 43 matches
- 2005
- Gábor Bacsó, Danuta Michalak, Zsolt Tuza:
Dominating Bipartite Subgraphs in Graphs. Discuss. Math. Graph Theory 25(1-2): 85-94 (2005) - Gábor Bacsó, Attila Tálos, Zsolt Tuza:
Graph Domination in Distance Two. Discuss. Math. Graph Theory 25(1-2): 121-128 (2005) - Mostafa Blidia, Mustapha Chellali, Lutz Volkmann:
On the p-domination number of cactus graphs. Discuss. Math. Graph Theory 25(3): 355-361 (2005) - Mieczyslaw Borowiecki:
Preface. Discuss. Math. Graph Theory 25(1-2): 5 (2005) - Bostjan Bresar, Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Median and quasi-median direct products of graphs. Discuss. Math. Graph Theory 25(1-2): 183-196 (2005) - Izak Broere, Jozef Bucko, Bonita S. Wilson:
Note on partitions of planar graphs. Discuss. Math. Graph Theory 25(1-2): 211-215 (2005) - Jozef Bucko, Peter Mihók, Jean-François Saclé, Mariusz Wozniak:
A note on maximal common subgraphs of the Dirac's family of graphs. Discuss. Math. Graph Theory 25(3): 385-390 (2005) - Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid:
On a conjecture of Quintas and arc-traceability in upset tournaments. Discuss. Math. Graph Theory 25(3): 345-354 (2005) - Stanislaw Bylka:
Arithmetically maximal independent sets in infinite graphs. Discuss. Math. Graph Theory 25(1-2): 167-182 (2005) - Yair Caro, William Klostermeyer, Raphael Yuster:
Connected odd dominating sets in graphs. Discuss. Math. Graph Theory 25(3): 225-239 (2005) - Gary Chartrand, David Erwin, Donald W. VanderJagt, Ping Zhang:
On γ-labelings of trees. Discuss. Math. Graph Theory 25(3): 363-383 (2005) - Mustapha Chellali, Abdelkader Khelladi, Frédéric Maffray:
Exact double domination in graphs. Discuss. Math. Graph Theory 25(3): 291-302 (2005) - Nancy E. Clarke, Richard J. Nowakowski:
A Tandem version of the Cops and Robber Game played on products of graphs. Discuss. Math. Graph Theory 25(3): 241-249 (2005) - Marietjie Frick, Susan A. van Aardt, Gcina Dlamini, Jean E. Dunbar, Ortrud R. Oellermann:
The directed path partition conjecture. Discuss. Math. Graph Theory 25(3): 331-343 (2005) - Tomislav Doslic:
Mycielskians and matchings. Discuss. Math. Graph Theory 25(3): 261-266 (2005) - Ewa Drgas-Burchardt, Anna Fiedorowicz:
Maximal Hypergraphs with Respect to the Bounded Cost Hereditary Property. Discuss. Math. Graph Theory 25(1-2): 67-77 (2005) - Tomasz Dzido:
Multicolor Ramsey Numbers for Paths and Cycles. Discuss. Math. Graph Theory 25(1-2): 57-65 (2005) - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs. Discuss. Math. Graph Theory 25(3): 273-289 (2005) - Shinya Fujita:
On graphs G for which both G and 'G are claw-free. Discuss. Math. Graph Theory 25(3): 267-272 (2005) - Hortensia Galeana-Sánchez, Laura Pastrana Ramírez, Hugo Alberto Rincón-Mejía:
Kernels in monochromatic path digraphs. Discuss. Math. Graph Theory 25(3): 407-417 (2005) - Izolda Gorgol:
Planar Ramsey Numbers. Discuss. Math. Graph Theory 25(1-2): 45-50 (2005) - Frank Göring, Jochen Harant:
On Domination in Graphs. Discuss. Math. Graph Theory 25(1-2): 7-12 (2005) - Jochen Harant, Michael A. Henning:
On Double Domination in Graphs. Discuss. Math. Graph Theory 25(1-2): 29-34 (2005) - Michael A. Henning:
Graphs with double domination numbers. Discuss. Math. Graph Theory 25(1-2): 13-28 (2005) - Erhard Hexel:
On short cycles through prescribed vertices of a polyhedral graph. Discuss. Math. Graph Theory 25(3): 419-426 (2005) - Adam Idzik:
Estimation of cut-vertices in edge-coloured complete graphs. Discuss. Math. Graph Theory 25(1-2): 217-218 (2005) - Adam Idzik, Konstanty Junosza-Szaniawski:
Combinatorial Lemmas for Polyhedrons. Discuss. Math. Graph Theory 25(1-2): 95-102 (2005) - Peter Jacko, Stanislav Jendrol':
Distance Coloring of the Hexagonal Lattice. Discuss. Math. Graph Theory 25(1-2): 151-166 (2005) - Mohammed M. M. Jaradat:
An upper bound of the basis number of the strong product of graphs. Discuss. Math. Graph Theory 25(3): 391-406 (2005) - Konstanty Junosza-Szaniawski:
Coloring of G2-G, for Euclidesian graph G. Discuss. Math. Graph Theory 25(1-2): 219 (2005)
skipping 13 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-19 00:33 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