![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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
- 1985
- Jin Akiyama, Peter Frankl:
On the size of graphs with complete-factors. J. Graph Theory 9(1): 197-201 (1985) - Jin Akiyama, Mikio Kano:
Factors and factorizations of graphs - a survey. J. Graph Theory 9(1): 1-42 (1985) - Jin Akiyama, Mikio Kano:
Almost-regular factorization of graphs. J. Graph Theory 9(1): 123-128 (1985) - Brian Alspach, Roland Häggkvist:
Some observations on the oberwolfach problem. J. Graph Theory 9(1): 177-187 (1985) - Kiyoshi Ando:
Rao's conjecture on self-complementary graphs with K-factors. J. Graph Theory 9(1): 119-121 (1985) - Thomas Andreae:
On superperfect noncomparability graphs. J. Graph Theory 9(4): 523-532 (1985) - László Babai
:
Arc transitive covering digraphs and their eigenvalues. J. Graph Theory 9(3): 363-370 (1985) - Abdelhamid Benhocine, A. Pawel Wojda:
On self-complementation. J. Graph Theory 9(3): 335-341 (1985) - Claude Benzaken, Peter L. Hammer, Dominique de Werra:
Threshold characterization of graphs with dilworth number two. J. Graph Theory 9(2): 245-267 (1985) - Rainer Bodendiek, Klaus W. Wagner:
On some minimal graphs of the torus. J. Graph Theory 9(3): 411-417 (1985) - Béla Bollobás, Akira Saito, Nicholas C. Wormald:
Regular factors of regular graphs. J. Graph Theory 9(1): 97-103 (1985) - J. Adrian Bondy, László Lovász:
Lengths of cycles in halin graphs. J. Graph Theory 9(3): 397-410 (1985) - R. D. Cameron, Charles J. Colbourn, Ronald C. Read, Nicholas C. Wormald:
Cataloguing the graphs on 10 vertices. J. Graph Theory 9(4): 551-562 (1985) - Ching-Shui Cheng, Joseph C. Masaro, Chi Song Wong:
Do nearly balanced multigraphs have more spanning trees? J. Graph Theory 9(3): 335-341 (1985) - Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd:
An upper bound for the k-domination number of a graph. J. Graph Theory 9(4): 533-534 (1985) - Charles Delorme:
Large bipartite graphs with given degree and diameter. J. Graph Theory 9(3): 325-334 (1985) - Jeffrey H. Dinitz:
Orthogonal one-factorization graphs. J. Graph Theory 9(1): 147-159 (1985) - Dwight Duffus, Bill Sands, Robert E. Woodrow:
On the chromatic number of the product of graphs. J. Graph Theory 9(4): 487-495 (1985) - Hikoe Enomoto, Bill Jackson, P. Katerinis, Akira Saito:
Toughness and the existence of k-factors. J. Graph Theory 9(1): 87-95 (1985) - Paul Erdös:
Ulam, the man and the mathematician. J. Graph Theory 9(4): 445-449 (1985) - Abdol-Hossein Esfahanian:
Lower-bounds on the connectivities of a graph. J. Graph Theory 9(4): 503-511 (1985) - Martin Farber, B. Richter, H. Shank:
Edge-disjoint spanning trees: A connectedness theorem. J. Graph Theory 9(3): 319-324 (1985) - John Frederick Fink:
On smallest regular graphs with a given isopart. J. Graph Theory 9(1): 105-117 (1985) - Peter C. Fishburn, Ronald L. Graham:
Classes of interval graphs under expanding length restrictions. J. Graph Theory 9(4): 459-472 (1985) - Peter Frankl:
On the chromatic number of the general Kneser-graph. J. Graph Theory 9(2): 217-220 (1985) - Roberto W. Frucht, Reinaldo E. Giudici:
A note on the matching numbers of triangle-free graphs. J. Graph Theory 9(4): 455-458 (1985) - J. I. Hall:
Graphs with constant link and small degree or order. J. Graph Theory 9(3): 419-444 (1985) - Frank Harary, Michael Plantholt:
The graph reconstruction number. J. Graph Theory 9(4): 451-454 (1985) - Frank Harary, Robert W. Robinson:
Isomorphic factorizations X: Unsolved problems. J. Graph Theory 9(1): 67-86 (1985) - Heiko Harborth, Ingrid Mengersen:
An upper bound for the ramsey number r(K5 - e). J. Graph Theory 9(4): 483-485 (1985)
skipping 23 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-01 11:22 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