Остановите войну!
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
- 2009
- Xinhui An, Baoyindureng Wu:
List linear arboricity of planar graphs. Discuss. Math. Graph Theory 29(3): 499-510 (2009) - Michael Andresen:
On transitive orientations of G-e. Discuss. Math. Graph Theory 29(3): 423-467 (2009) - Mustapha Aouchiche, Pierre Hansen, Dragan Stevanovic:
Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index. Discuss. Math. Graph Theory 29(1): 15-37 (2009) - Halina Bielak:
Multicolor Ramsey numbers for some paths and cycles. Discuss. Math. Graph Theory 29(2): 209-218 (2009) - Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh:
Decompositions of quadrangle-free planar graphs. Discuss. Math. Graph Theory 29(1): 87-99 (2009) - Mieczyslaw Borowiecki, Anna Fiedorowicz, Mariusz Haluszczak:
Acyclic reducible bounds for outerplanar graphs. Discuss. Math. Graph Theory 29(2): 219-239 (2009) - Piotr Borowiecki, Danuta Michalak, Elzbieta Sidorowicz:
Preface of guest editors. Discuss. Math. Graph Theory 29(2): 207 (2009) - Y. M. Borse, Kiran Dalvi, M. M. Shikare:
Forbidden-minor characterization for the class of graphic element splitting matroids. Discuss. Math. Graph Theory 29(3): 629-644 (2009) - Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discuss. Math. Graph Theory 29(1): 143-162 (2009) - Jozef Bucko, Peter Mihók:
On infinite uniquely partitionable graphs and graph properties of finite character. Discuss. Math. Graph Theory 29(2): 241-251 (2009) - Alberto Castejón, Mikhail I. Ostrovskii:
Minimum congestion spanning trees of grids and discrete toruses. Discuss. Math. Graph Theory 29(3): 511-519 (2009) - Gary Chartrand, Futaba Okamoto, Craig W. Rasmussen, Ping Zhang:
The set chromatic number of a graph. Discuss. Math. Graph Theory 29(3): 545-561 (2009) - Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann:
Bounds on the global offensive k-alliance number in graphs. Discuss. Math. Graph Theory 29(3): 597-613 (2009) - Daniel W. Cranston:
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discuss. Math. Graph Theory 29(1): 163-178 (2009) - Július Czap, Stanislav Jendrol':
Colouring vertices of plane graphs under restrictions given by faces. Discuss. Math. Graph Theory 29(3): 521-543 (2009) - Italo J. Dejter:
Quasiperfect domination in triangular lattices. Discuss. Math. Graph Theory 29(1): 179-198 (2009) - Pietra Delgado-Escalante, Hortensia Galeana-Sánchez:
Kernels and cycles' subdivisions in arc-colored tournaments. Discuss. Math. Graph Theory 29(1): 101-117 (2009) - Dariusz Dereniowski:
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs. Discuss. Math. Graph Theory 29(2): 253-261 (2009) - Ewa Drgas-Burchardt:
Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties. Discuss. Math. Graph Theory 29(2): 263-274 (2009) - Aneta Dudek, Malgorzata Zwonek:
(H, k) stable bipartite graphs with the minimum size. Discuss. Math. Graph Theory 29(3): 573-581 (2009) - Lixia Fan, Zhihe Liang:
On Lee's conjecture and some results. Discuss. Math. Graph Theory 29(3): 481-498 (2009) - Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers:
Potentially H-bigraphic sequences. Discuss. Math. Graph Theory 29(3): 583-596 (2009) - Robert Fidytek, Hanna Furmanczyk, Pawel Zylinski:
Equitable coloring of Kneser graphs. Discuss. Math. Graph Theory 29(1): 119-142 (2009) - Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On odd and semi-odd linear partitions of cubic graphs. Discuss. Math. Graph Theory 29(2): 275-292 (2009) - Jean-Luc Fouquet, Jean-Marie Vanherpe:
On normal partitions in cubic graphs. Discuss. Math. Graph Theory 29(2): 293-312 (2009) - Hortensia Galeana-Sánchez, Ricardo Gómez, Juan José Montellano-Ballesteros:
Independent transversals of longest paths in locally semicomplete and transitive digraphs. Discuss. Math. Graph Theory 29(3): 469-480 (2009) - Hortensia Galeana-Sánchez, Martín Manrique:
Directed hypergraphs: A tool for researching digraphs and hypergraphs. Discuss. Math. Graph Theory 29(2): 313-335 (2009) - Hortensia Galeana-Sánchez, Laura Pastrana:
k-Kernels and some operations in digraphs. Discuss. Math. Graph Theory 29(1): 39-49 (2009) - Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala:
Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs. Discuss. Math. Graph Theory 29(2): 337-347 (2009) - Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala:
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments. Discuss. Math. Graph Theory 29(2): 349-360 (2009)
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-12 11:54 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