Остановите войну!
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 60 matches
- 1988
- Martin Aigner, Eberhard Triesch:
Searching for an edge in a graph. J. Graph Theory 12(1): 45-57 (1988) - Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Gordon F. Royle:
An 11-vertex theorem for 3-connected cubic graphs. J. Graph Theory 12(4): 561-570 (1988) - Dan Archdeacon, R. Bruce Richter:
On the parity of crossing numbers. J. Graph Theory 12(3): 307-310 (1988) - Hans-Jürgen Bandelt, Henry Martyn Mulder:
Regular pseudo-median graphs. J. Graph Theory 12(4): 533-549 (1988) - Daniel Bienstock, Ervin Györi:
Average distance in graphs with removed elements. J. Graph Theory 12(3): 375-390 (1988) - André Bouchet:
Transforming trees by successive local complementations. J. Graph Theory 12(2): 195-207 (1988) - Haitze J. Broersma:
Existence of Δλ-cycles and Δλ-paths. J. Graph Theory 12(4): 499-507 (1988) - Fred Buckley, Martin Lewinter:
A note on graphs with diameter-preserving spanning trees. J. Graph Theory 12(4): 525-528 (1988) - Lou Caccetta, Paul Erdös, K. Vijayan:
Graphs with unavoidable subgraphs with large degrees. J. Graph Theory 12(1): 17-27 (1988) - Paul A. Catlin:
A reduction method to find spanning Eulerian subgraphs. J. Graph Theory 12(1): 29-44 (1988) - F. R. K. Chung:
The average distance and the independence number. J. Graph Theory 12(2): 229-235 (1988) - Fan R. K. Chung, Joel E. Cohen, Ronald L. Graham:
Pursuit - Evasion games on graphs. J. Graph Theory 12(2): 159-167 (1988) - Mark N. Ellingham, László Pyber, Xingxing Yu:
Claw-free graphs are edge reconstructible. J. Graph Theory 12(3): 445-451 (1988) - Hikoe Enomoto, Katsuhiro Ota, Mikio Kano:
A sufficient condition for a bipartite graph to have a k-factor. J. Graph Theory 12(1): 141-151 (1988) - Paul Erdös:
A tribute to Torrence Parsons. J. Graph Theory 12(2): v-vi (1988) - Paul Erdös, Mark Goldberg, János Pach, Joel Spencer:
Cutting a graph into two dissimilar halves. J. Graph Theory 12(1): 121-131 (1988) - Siemion Fajtlowicz:
A characterization of radius-critical graphs. J. Graph Theory 12(4): 529-532 (1988) - Genghua Fan:
Degree sum for a triangle in a graph. J. Graph Theory 12(2): 249-263 (1988) - Peter Frankl, János Pach:
An extremal problem on Kr-free graphs. J. Graph Theory 12(4): 519-523 (1988) - A. M. H. Gerards:
Homomorphisms of graphs into odd cycles. J. Graph Theory 12(1): 73-83 (1988) - Zhao Guangfu:
Characterizations of second iterated line graphs. J. Graph Theory 12(2): 285-294 (1988) - András Gyárfás, Jenö Lehel:
On-line and first fit colorings of graphs. J. Graph Theory 12(2): 217-227 (1988) - S. Louis Hakimi, Edward F. Schmeichel:
Chromatic factorizations of a graph. J. Graph Theory 12(2): 177-182 (1988) - Frank Harary:
In memory of Torrence Parsons, 1941-1987. J. Graph Theory 12(2): iii-ii (1988) - Katherine Heinrich, Guizhen Liu:
A lower bound on the number of spanning trees with k end-vertices. J. Graph Theory 12(1): 95-100 (1988) - George R. T. Hendry:
On minimum degree in Hamiltonian path graphs. J. Graph Theory 12(4): 491-497 (1988) - Chính T. Hoàng, N. Khouzam:
On brittle graphs. J. Graph Theory 12(3): 391-404 (1988) - M. Hofmeister:
Counting double covers of graphs. J. Graph Theory 12(3): 437-444 (1988) - Bill Jackson:
Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs. J. Graph Theory 12(3): 429-436 (1988) - Douglas S. Jungreis:
Generalized hamiltonian circuits in the cartesian product of two-directed cycles. J. Graph Theory 12(1): 113-120 (1988)
skipping 30 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-05-28 02:32 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