![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 53 matches
- 1983
- Mohammed Abu-Sbeih, Torrence D. Parsons:
Embeddings of bipartite graphs. J. Graph Theory 7(3): 325-334 (1983) - Noga Alon:
On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems. J. Graph Theory 7(1): 91-94 (1983) - Hans-Jürgen Bandelt, Henry Martyn Mulder
:
Infinite median graphs, (0, 2)-graphs, and hypercubes. J. Graph Theory 7(4): 487-497 (1983) - Lynn Margaret Batten:
Geodesic subgraphs. J. Graph Theory 7(2): 159-163 (1983) - József Beck:
On size Ramsey number of paths, trees, and circuits. I. J. Graph Theory 7(1): 115-129 (1983) - Abdelhamid Benhocine, A. Pawel Wojda:
On the existence of specified cycles in a tournament. J. Graph Theory 7(4): 469-473 (1983) - Béla Bollobás, Ove Frank, Michal Karonski:
On 4-cycles in random bipartite tournaments. J. Graph Theory 7(2): 183-194 (1983) - Andries E. Brouwer:
The uniqueness of the strongly regular graph on 77 points. J. Graph Theory 7(4): 455-461 (1983) - S. A. Burr:
Diagonal Ramsey numbers for small graphs. J. Graph Theory 7(1): 57-69 (1983) - Stefan A. Burr, Paul Erdös:
Generalizations of a Ramsey-theoretic result of chvátal. J. Graph Theory 7(1): 39-51 (1983) - Stefan A. Burr, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
On Ramsey numbers involving starlike multipartite graphs. J. Graph Theory 7(4): 395-409 (1983) - Mao-Cheng Cai:
Arc-disjoint arborescences of digraphs. J. Graph Theory 7(2): 235-240 (1983) - Gary Chartrand, S. F. Kapoor, E. A. Nordhaus:
Hamiltonian path graphs. J. Graph Theory 7(4): 419-427 (1983) - Amanda G. Chetwynd
, Robin J. Wilson:
The rise and fall of the critical graph conjecture. J. Graph Theory 7(2): 153-157 (1983) - F. R. K. Chung:
On a Ramsey-type problem. J. Graph Theory 7(1): 79-83 (1983) - F. R. K. Chung, Charles M. Grinstead:
A survey of bounds for classical Ramsey numbers. J. Graph Theory 7(1): 25-37 (1983) - John H. Conway, Cameron McA. Gordon:
Knots and links in spatial graphs. J. Graph Theory 7(4): 445-453 (1983) - A. M. Dawes, John B. Florence:
Graph dismantling problems. J. Graph Theory 7(3): 335-347 (1983) - Paul Erdös, János Pach:
On a Quasi-Ramsey problem. J. Graph Theory 7(1): 137-147 (1983) - Paul Erdös, Edgar M. Palmer, Robert W. Robinson:
Local connectivity of a random graph. J. Graph Theory 7(4): 411-417 (1983) - Ralph J. Faudree, J. Sheehan:
Size Ramsey numbers for small-order graphs. J. Graph Theory 7(1): 53-55 (1983) - John Frederick Fink:
Randomly antitraceable digraphs. J. Graph Theory 7(2): 273 (1983) - Peter C. Fishburn:
Packing graphs with odd and even trees. J. Graph Theory 7(3): 369-383 (1983) - Ronald J. Gould, Michael S. Jacobson:
On the Ramsey number of trees versus graphs with large clique number. J. Graph Theory 7(1): 71-78 (1983) - Thom Grace:
On sequential labelings of graphs. J. Graph Theory 7(2): 195-201 (1983) - Ronald L. Graham:
Euclidean Ramsey theorems on the n-sphere. J. Graph Theory 7(1): 105-114 (1983) - Jerrold W. Grossman:
Graphs with unique Ramsey colorings. J. Graph Theory 7(1): 85-90 (1983) - Filip Guldan, Pavel Tomasta:
New lower bounds of some diagonal Ramsey numbers. J. Graph Theory 7(1): 149-151 (1983) - András Gyárfás:
Vertex coverings by monochromatic paths and cycles. J. Graph Theory 7(1): 131-135 (1983) - András Hajnal, Vera T. Sós:
Paul Erdös is seventy. J. Graph Theory 7(4): 391-393 (1983)
skipping 23 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-02 15: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