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 43 matches
- 1986
- Andrzej Rucinski, Andrew Vince:
Strongly balanced graphs and random graphs. J. Graph Theory 10(2): 251-264 (1986) - Ignacio Alegre, Miguel Angel Fiol, J. Luis A. Yebra:
Some large graphs with given degree and diameter. J. Graph Theory 10(2): 219-224 (1986) - Noga Alon:
The longest cycle of a graph with a large minimal degree. J. Graph Theory 10(1): 123-127 (1986) - Kiyoshi Ando, Hirobumi Mizuno:
The six bidecomposable graphs. J. Graph Theory 10(1): 117-121 (1986) - Dan Archdeacon:
The nonorientable genus is additive. J. Graph Theory 10(3): 363-383 (1986) - Dan Archdeacon:
The orientable genus is nonadditive. J. Graph Theory 10(3): 385-401 (1986) - Kouhei Asano:
The crossing number of K1, 3, n and K2, 3, n. J. Graph Theory 10(1): 1-8 (1986) - Lowell W. Beineke:
Desert island theorems. J. Graph Theory 10(3): 325-329 (1986) - Edward A. Bender, L. Bruce Richmond:
Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities. J. Graph Theory 10(1): 41-46 (1986) - Abdelhamid Benhocine, L. Clark, N. Köhler, Henk Jan Veldman:
On circuits and pancyclic line graphs. J. Graph Theory 10(3): 411-425 (1986) - Andreas Blass, Bruce E. Sagan:
Bijective proofs of two broken circuit theorems. J. Graph Theory 10(1): 15-21 (1986) - Francis T. Boesch:
On unreliability polynomials and graph connectivity in reliable network synthesis. J. Graph Theory 10(3): 339-352 (1986) - J. Adrian Bondy, F. Y. Halberstam:
Parity theorems for paths and cycles in graphs. J. Graph Theory 10(1): 107-115 (1986) - Stefan A. Burr:
An inequality involving the vertex arboricity and edge arboricity of a graph. J. Graph Theory 10(3): 403-404 (1986) - Chong-Yun Chao, Nian-Zu Li, Shao-Ji Xu:
On q-trees. J. Graph Theory 10(1): 129-136 (1986) - Gek Ling Chia, Chong-Keang Lim:
A class of self-complementary vertex-transitive digraphs. J. Graph Theory 10(2): 241-249 (1986) - Derek G. Corneil:
Families of graphs complete for the strong perfect graph Conjecture. J. Graph Theory 10(1): 33-40 (1986) - Lenore J. Cowen, Robert Cowen, Douglas R. Woodall:
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. J. Graph Theory 10(2): 187-195 (1986) - Nathaniel Dean:
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? J. Graph Theory 10(3): 299-308 (1986) - Erik A. van Doorn:
Connectivity of circulant digraphs. J. Graph Theory 10(1): 9-14 (1986) - D. A. Duffus, Denis Hanson:
Minimal k-saturated and color critical graphs of prescribed minimum degree. J. Graph Theory 10(1): 55-67 (1986) - Pierre Fraisse:
A new sufficient condition for hamiltonian graphs. J. Graph Theory 10(3): 405-409 (1986) - F. Göbel, Henk Jan Veldman:
Even graphs. J. Graph Theory 10(2): 225-239 (1986) - Per Hage, Frank Harary:
Some genuine graph models in anthropology. J. Graph Theory 10(3): 353-361 (1986) - S. Louis Hakimi, Oded Kariv:
A generalization of edge-coloring in graphs. J. Graph Theory 10(2): 139-154 (1986) - Frank Harary:
Editorial: Changing of the guard. J. Graph Theory 10(3): i (1986) - Frank Harary:
Graph theory as applied mathematics. J. Graph Theory 10(3): iii-iv (1986) - Ivan Havel, Petr Liebl:
One-legged caterpillars span hypercubes. J. Graph Theory 10(1): 69-77 (1986) - George R. T. Hendry:
Existence of graphs with prescribed mean distance. J. Graph Theory 10(2): 173-175 (1986) - Michael S. Jacobson, Lael F. Kinch:
On the domination of the products of graphs II: Trees. J. Graph Theory 10(1): 97-106 (1986)
skipping 13 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-10-19 19:37 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