Остановите войну!
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 23 matches
- 2000
- Ron Aharoni, Penny Haxell:
Hall's theorem for hypergraphs. J. Graph Theory 35(2): 83-88 (2000) - Noga Alon, András Gyárfás, Miklós Ruszinkó:
Decreasing the diameter of bounded degree graphs. J. Graph Theory 35(3): 161-172 (2000) - Noga Alon, Michael Krivelevich, Paul D. Seymour:
Long cycles in critical graphs. J. Graph Theory 35(3): 193-196 (2000) - Robert C. Brigham, Julie R. Carrington, Ronald D. Dutton, Joseph Fiedler, Richard P. Vitray:
An extremal bandwidth problem for bipartite graphs. J. Graph Theory 35(4): 278-289 (2000) - Reinhard Diestel:
An accessibility theorem for infinite graph minors. J. Graph Theory 35(4): 273-277 (2000) - Dennis Eichhorn, Dhruv Mubayi, Kevin O'Bryant, Douglas B. West:
The edge-bandwidth of theta graphs. J. Graph Theory 35(2): 89-98 (2000) - Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
On k-ordered graphs. J. Graph Theory 35(2): 69-82 (2000) - Fred Galvin:
Another note on cliques and independent sets. J. Graph Theory 35(3): 173-175 (2000) - Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On graphs with linear Ramsey numbers. J. Graph Theory 35(3): 176-192 (2000) - Rudolf Halin:
Miscellaneous problems on infinite graphs. J. Graph Theory 35(2): 128-151 (2000) - Frédéric Havet, Stéphan Thomassé:
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture. J. Graph Theory 35(4): 244-256 (2000) - Michael A. Henning:
Graphs with large total domination number. J. Graph Theory 35(1): 21-45 (2000) - Chula J. Jayawardene, Cecil C. Rousseau:
The Ramsey number for a cycle of length five vs. a complete graph of order six. J. Graph Theory 35(2): 99-108 (2000) - Petra Johann:
On the structure of graphs with a unique k-factor. J. Graph Theory 35(4): 227-243 (2000) - Alexander K. Kelmans:
Crossing properties of graph reliability functions. J. Graph Theory 35(3): 206-221 (2000) - Guojun Li:
Edge disjoint Hamilton cycles in graphs. J. Graph Theory 35(1): 8-20 (2000) - Dragan Marusic:
Constructing cubic edge- but not vertex-transitive graphs. J. Graph Theory 35(2): 152-160 (2000) - Dragan Marusic, Tomaz Pisanski:
The Gray graph revisited. J. Graph Theory 35(1): 1-7 (2000) - William McCuaig:
Even dicycles. J. Graph Theory 35(1): 46-68 (2000) - Sean McGuinness:
On decomposing a graph into nontrivial bonds. J. Graph Theory 35(2): 109-127 (2000) - Fábio Protti, Jayme Luiz Szwarcfiter:
Clique-inverse graphs of K3-free and K4-free graphs. J. Graph Theory 35(4): 257-272 (2000) - Gelasio Salazar:
A lower bound for the crossing number of Cm × Cn. J. Graph Theory 35(3): 222-226 (2000) - Daniel P. Sanders, Yue Zhao:
Coloring edges of embedded graphs. J. Graph Theory 35(3): 197-205 (2000)
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-16 17:53 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