Остановите войну!
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 21 matches
- 2009
- Peter Allen:
Forbidden induced bipartite graphs. J. Graph Theory 60(3): 219-241 (2009) - Kiyoshi Ando:
A local structure theorem on 5-connected graphs. J. Graph Theory 60(2): 99-129 (2009) - Ch. Sobhan Babu, Ajit A. Diwan:
Disjoint cycles with chords in graphs. J. Graph Theory 60(2): 87-98 (2009) - Tomasz Bartnicki, Jaroslaw Grytczuk, Stanislaw Niwczyk:
Weight choosability of graphs. J. Graph Theory 60(3): 242-256 (2009) - Anthony Bonato, Jeannette C. M. Janssen, Changping Wang:
The n-ordered graphs: A new graph class. J. Graph Theory 60(3): 204-218 (2009) - Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu:
M-degrees of quadrangle-free planar graphs. J. Graph Theory 60(1): 80-85 (2009) - Carolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan:
Unavoidable parallel minors of 4-connected graphs. J. Graph Theory 60(4): 313-326 (2009) - Daniel W. Cranston:
Regular bipartite graphs are antimagic. J. Graph Theory 60(3): 173-182 (2009) - Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl:
Average distance and maximum induced forest. J. Graph Theory 60(1): 31-54 (2009) - Michael A. Henning, Anders Yeo:
Total domination in 2-connected graphs and in graphs with no induced 6-cycles. J. Graph Theory 60(1): 55-79 (2009) - Anthony J. W. Hilton:
On the number of (r, r+1)- factors in an (r, r+1)-factorization of a simple graph. J. Graph Theory 60(4): 257-268 (2009) - Elad Horev, Roi Krakovski:
Polychromatic colorings of bounded degree plane graphs. J. Graph Theory 60(4): 269-283 (2009) - Hal A. Kierstead, André Kündgen, Craig Timmons:
Star coloring bipartite planar graphs. J. Graph Theory 60(1): 1-10 (2009) - Cheng Yeaw Ku, Benjamin B. McMillan:
Independent sets of maximal size in tensor powers of vertex-transitive graphs. J. Graph Theory 60(4): 295-301 (2009) - Qi Liu, Douglas B. West, Gexin Yu:
Implications among linkage properties in graphs. J. Graph Theory 60(4): 327-337 (2009) - László Lovász, Balázs Szegedy:
Contractors and connectors of graph algebras. J. Graph Theory 60(1): 11-30 (2009) - Rong Luo, Lianying Miao, Yue Zhao:
The size of edge chromatic critical graphs with maximum degree 6. J. Graph Theory 60(2): 149-171 (2009) - Dirk Meierling:
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments. J. Graph Theory 60(2): 130-148 (2009) - Raiji Mukae, Atsuhiro Nakamoto:
K6-minors in triangulations and complete quadrangulations. J. Graph Theory 60(4): 302-312 (2009) - Sang-il Oum:
Excluding a bipartite circle graph from line graphs. J. Graph Theory 60(3): 183-203 (2009) - Anja Pruchnewski, Margit Voigt:
Precoloring extension for K4-minor-free graphs. J. Graph Theory 60(4): 284-294 (2009)
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-07-08 05:18 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