![](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 28 matches
- 2003
- Noga Alon, Michael Krivelevich, Benny Sudakov:
Induced subgraphs of prescribed size. J. Graph Theory 43(4): 239-251 (2003) - Francis K. Bell:
Line graphs of bipartite graphs with Hamiltonian paths. J. Graph Theory 43(2): 137-149 (2003) - Dominique Bénard, André Bouchet, R. Bruce Richter:
Fold-2-covering triangular embeddings. J. Graph Theory 43(2): 79-92 (2003) - Alex R. Berg, Bill Jackson, Tibor Jordán:
Highly edge-connected detachments of graphs and digraphs. J. Graph Theory 43(1): 67-77 (2003) - Etienne Birmelé:
Tree-width and circumference of graphs. J. Graph Theory 43(1): 24-25 (2003) - Anthony Bonato, Claude Tardif:
Large families of mutually embeddable vertex-transitive graphs. J. Graph Theory 43(2): 99-106 (2003) - Lou Caccetta, Samy El-Batanouny, J. Huang:
On vertex critical graphs with prescribed diameter. J. Graph Theory 43(2): 117-131 (2003) - Mike Daven, Jim A. MacDougall, C. A. Rodger:
Maximal sets of hamilton cycles in complete multipartite graphs. J. Graph Theory 43(1): 49-66 (2003) - Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer:
Two-factors each component of which contains a specified vertex. J. Graph Theory 43(3): 188-198 (2003) - Jirí Fiala:
NP completeness of the edge precoloring extension problem on bipartite graphs. J. Graph Theory 43(2): 156-160 (2003) - Miguel Angel Fiol
, Joan Gimbert, José Gómez, Yaokun Wu:
On Moore bipartite digraphs. J. Graph Theory 43(3): 171-187 (2003) - Joel Foisy:
A newly recognized intrinsically knotted graph. J. Graph Theory 43(3): 199-209 (2003) - Elena Grigorescu:
Decreasing the diameter of cycles. J. Graph Theory 43(4): 299-303 (2003) - Anthony J. W. Hilton, Matthew Johnson
:
An algorithm for finding factorizations of complete graphs. J. Graph Theory 43(2): 132-136 (2003) - Youngsik Huh
, Seungsang Oh
:
Planar graphs producing no strongly almost trivial embedding. J. Graph Theory 43(4): 319-326 (2003) - Wilfried Imrich
, Riste Skrekovski
:
A theorem on integer flows on cartesian products of graphs. J. Graph Theory 43(2): 93-98 (2003) - Tao Jiang, Seog-Jin Kim, Douglas B. West:
Isometric cycles, cutsets, and crowning of bridged graphs. J. Graph Theory 43(3): 161-170 (2003) - Atsushi Kaneko, Kiyoshi Yoshimoto:
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. J. Graph Theory 43(4): 269-279 (2003) - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto
, Katsuhiro Ota:
2-connected 7-coverings of 3-connected graphs on surfaces. J. Graph Theory 43(1): 26-36 (2003) - Xuechao Li, Cun-Quan Zhang:
Chords of longest circuits of graphs embedded in torus and Klein bottle. J. Graph Theory 43(1): 1-23 (2003) - Roland Lortz, Ingrid Mengersen:
Off-diagonal and asymptotic results on the Ramsey number r(K2, m, K2, n). J. Graph Theory 43(4): 252-268 (2003) - Bojan Mohar:
Circular colorings of edge-weighted graphs. J. Graph Theory 43(2): 107-116 (2003) - Donald A. Nelson:
The structure of saturated critical blocks. J. Graph Theory 43(3): 223-237 (2003) - Zhishi Pan, Xuding Zhu:
Construction of graphs with given circular flow numbers. J. Graph Theory 43(4): 304-318 (2003) - Norbert Polat:
On constructible graphs, locally Helly graphs, and convexity. J. Graph Theory 43(4): 280-298 (2003) - Zdenek Ryjácek, Richard H. Schelp:
Contractibility techniques as a closure concept. J. Graph Theory 43(1): 37-48 (2003) - Peter F. Stadler
:
Minimum cycle bases of Halin graphs. J. Graph Theory 43(2): 150-155 (2003) - Ioan Tomescu
:
Maximal σ-polynomials of connected 3-chromatic graphs. J. Graph Theory 43(3): 210-222 (2003)
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-24 09:42 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