Остановите войну!
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 47 matches
- 1980
- B. Devadas Acharya:
Spectral criterion for cycle balance in networks. J. Graph Theory 4(1): 1-11 (1980) - Ahmad Fawzi Alameddine:
On the number of cycles of length 4 in a maximal planar graph. J. Graph Theory 4(4): 417-422 (1980) - Takao Asano, Takao Nishizeki, Takahiro Watanabe:
An upper bound on the length of a Hamiltonian walk of a maximal planar graph. J. Graph Theory 4(3): 315-336 (1980) - Peter Avery:
Condition for a tournament score sequence to be simple. J. Graph Theory 4(2): 157-164 (1980) - David W. Bange, Anthony E. Barkauskas, Peter J. Slater:
Conservative graphs. J. Graph Theory 4(1): 81-91 (1980) - Curtis A. Barefoot, Roger C. Entringer:
Extremal maximal uniquely hamiltonian graphs. J. Graph Theory 4(1): 93-100 (1980) - Douglas Bauer:
Line-graphical degree sequences. J. Graph Theory 4(2): 219-232 (1980) - Lowell W. Beineke, Richard D. Ringeisen:
On the crossing numbers of products of cycles and graphs of order four. J. Graph Theory 4(2): 145-155 (1980) - Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Girth in digraphs. J. Graph Theory 4(3): 337-341 (1980) - Francis T. Boesch, Charles L. Suffel:
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity. J. Graph Theory 4(4): 363-370 (1980) - Richard A. Brualdi, Frank Harary, Zevi Miller:
Bigraphs versus digraphs via matrices. J. Graph Theory 4(1): 51-73 (1980) - Fred Buckley:
A Ramsey property for graph invariants. J. Graph Theory 4(4): 383-387 (1980) - Stefan A. Burr:
A ramsey-theoretic result involving chromatic numbers. J. Graph Theory 4(2): 241-242 (1980) - Stefan A. Burr, Vera Rosta:
On the Ramsey multiplicities of graphs - problems and recent results. J. Graph Theory 4(4): 347-361 (1980) - Peter J. Cameron:
A note on generalized line graphs. J. Graph Theory 4(2): 243-245 (1980) - Gary Chartrand, Ronald J. Gould, Albert D. Polimeni:
On ramsey numbers of forests versus nearly complete graphs. J. Graph Theory 4(2): 233-239 (1980) - Charles Delorme:
Two sets of graceful graphs. J. Graph Theory 4(2): 247-250 (1980) - Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo:
Cycles with a chord are graceful. J. Graph Theory 4(4): 409-415 (1980) - Alan Donald:
An upper bound for the path number of a graph. J. Graph Theory 4(2): 189-201 (1980) - Stefano Fanelli:
On a conjecture on maximal planar sequences. J. Graph Theory 4(4): 371-375 (1980) - Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
All triangle-graph ramsey numbers for connected graphs of order six. J. Graph Theory 4(3): 293-300 (1980) - Donald L. Goldsmith, Bennet Manvel, Vance Faber:
Separation of graphs into three components by the removal of edges. J. Graph Theory 4(2): 213-218 (1980) - Jonathan L. Gross, Frank Harary:
Some problems in topological graph theory. J. Graph Theory 4(3): 253-263 (1980) - Jonathan L. Gross, Samuel J. Lomonaco:
A determination of the toroidal k-metacyclic groups. J. Graph Theory 4(2): 165-172 (1980) - Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi:
Hypotraceable digraphs. J. Graph Theory 4(4): 377-381 (1980) - J. I. Hall:
Locally petersen graphs. J. Graph Theory 4(2): 173-187 (1980) - Peter Horák, Jozef Sirán:
Note on a new coloring number of a graph. J. Graph Theory 4(1): 111-113 (1980) - Brad Jackson:
Triangular embeddings of K((i-2) n, n, ..., n). J. Graph Theory 4(1): 21-30 (1980) - Medha Javdekar:
Note on Choudum's "chromatic bounds for a class of graphs". J. Graph Theory 4(3): 265-267 (1980) - Alexander K. Kelmans:
Concept of a vertex in a matroid and 3-connected graphs. J. Graph Theory 4(1): 13-19 (1980)
skipping 17 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-06-04 11:00 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