Остановите войну!
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 24 matches
- 2000
- Cristina Bazgan, Hao Li, Mariusz Wozniak:
On the Loebl-Komlós-Sós conjecture. J. Graph Theory 34(4): 269-276 (2000) - Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze:
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k. J. Graph Theory 34(1): 42-59 (2000) - Stephan Brandt, Odile Favaron, Zdenek Ryjácek:
Closure and stable Hamiltonian properties in claw-free graphs. J. Graph Theory 34(1): 30-41 (2000) - Fan R. K. Chung, Shing-Tung Yau:
A Harnack inequality for Dirichlet eigenvalues. J. Graph Theory 34(4): 247-257 (2000) - Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech:
A characterization of (γ, i)-trees. J. Graph Theory 34(4): 277-292 (2000) - Ernest J. Cockayne, Gary MacGillivray, Jill Simmons:
CO-irredundant Ramsey numbers for graphs. J. Graph Theory 34(4): 258-268 (2000) - Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Triangle-free graphs that are signable without even holes. J. Graph Theory 34(3): 204-220 (2000) - Mark N. Ellingham, D. K. Menser:
Girth, minimum degree, and circumference. J. Graph Theory 34(3): 221-233 (2000) - Hikoe Enomoto, Katsuhiro Ota:
Partitions of a graph into paths with prescribed endvertices and lengths. J. Graph Theory 34(2): 163-169 (2000) - Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech:
Total domination in graphs with minimum degree three. J. Graph Theory 34(1): 9-19 (2000) - Zoltán Füredi, Dhruv Mubayi, Douglas B. West:
Multiple vertex coverings by specified induced subgraphs. J. Graph Theory 34(2): 180-190 (2000) - Amel Harkat-Benhamdine, Hao Li, Feng Tian:
Cyclability of 3-connected graphs. J. Graph Theory 34(3): 191-203 (2000) - Johannes H. Hattingh, Michael A. Henning:
Characterizations of trees with equal domination parameters. J. Graph Theory 34(2): 142-153 (2000) - Michael A. Henning:
On cliques and bicliques. J. Graph Theory 34(1): 60-66 (2000) - Peter Horák, Katherine Heinrich:
Partitioning infinite trees. J. Graph Theory 34(2): 113-127 (2000) - Robert Jajcay, Dale M. Mesner:
Embedding arbitrary finite simple graphs into small strongly regular graphs. J. Graph Theory 34(1): 1-8 (2000) - Tommy R. Jensen, Carsten Thomassen:
The color space of a graph. J. Graph Theory 34(3): 234-245 (2000) - Valery A. Liskovets, Reinhard Pöschel:
Non-Cayley-isomorphic self-complementary circulant graphs. J. Graph Theory 34(2): 128-141 (2000) - Dragan Marusic, Adrian O. Waller:
Half-transitive graphs of valency 4 with prescribed attachment numbers. J. Graph Theory 34(1): 89-99 (2000) - Bojan Mohar:
Light paths in 4-connected graphs in the plane and other surfaces. J. Graph Theory 34(2): 170-179 (2000) - Dhruv Mubayi:
Graphic sequences that have a realization with large clique number. J. Graph Theory 34(1): 20-29 (2000) - Peter Niemeyer, Mark E. Watkins:
Geodetic rays and fibers in periodic graphs. J. Graph Theory 34(1): 67-88 (2000) - Steven D. Noble, D. J. A. Welsh:
Knot graphs. J. Graph Theory 34(1): 100-111 (2000) - Hong Wang:
Digraphs containing every possible pair of dicycles. J. Graph Theory 34(2): 154-162 (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-25 07:34 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