Остановите войну!
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 28 matches
- 2011
- Robert E. L. Aldred, Michael D. Plummer:
Proximity thresholds for matching extension in planar and projective planar triangulations. J. Graph Theory 67(1): 38-46 (2011) - Patrick Bahls:
Channel assignment on Cayley graphs. J. Graph Theory 67(3): 169-177 (2011) - J. Adrian Bondy, F. Mercier:
Switching reconstruction of digraphs. J. Graph Theory 67(4): 332-348 (2011) - Oleg V. Borodin, Anna O. Ivanova:
List strong linear 2-arboricity of sparse graphs. J. Graph Theory 67(2): 83-90 (2011) - Andrew Bowler, Paul Brown, Trevor I. Fenner, Wendy J. Myrvold:
Recognizing connectedness from vertex-deleted subgraphs. J. Graph Theory 67(4): 285-299 (2011) - Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding paths between 3-colorings. J. Graph Theory 67(1): 69-82 (2011) - Amit Chakrabarti, Subhash Khot:
Combinatorial theorems about embedding trees on the real line. J. Graph Theory 67(2): 153-168 (2011) - Ya-Chen Chen:
All minimum C5-saturated graphs. J. Graph Theory 67(1): 9-26 (2011) - Jonathan Cutler, A. J. Radcliffe:
Extremal graphs for homomorphisms. J. Graph Theory 67(4): 261-284 (2011) - Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl:
On a conjecture of Thomassen concerning subgraphs of large girth. J. Graph Theory 67(4): 316-331 (2011) - Nick Gravin, Ning Chen:
A note on k-shortest paths problem. J. Graph Theory 67(1): 34-37 (2011) - Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. J. Graph Theory 67(2): 124-138 (2011) - Jochen Harant, Stanislav Jendrol', Tomás Madaras:
Upper bounds on the sum of powers of the degrees of a simple planar graph. J. Graph Theory 67(2): 112-123 (2011) - Tao Jiang:
Compact topological minors in graphs. J. Graph Theory 67(2): 139-152 (2011) - Ken-ichi Kawarabayashi, Kenta Ozeki:
2- and 3-factors of graphs on surfaces. J. Graph Theory 67(4): 306-315 (2011) - Andrew D. King:
Hitting all maximum cliques with a stable set using lopsided independent transversals. J. Graph Theory 67(4): 300-305 (2011) - Nicholas Korpelainen, Vadim V. Lozin:
Bipartite induced subgraphs and well-quasi-ordering. J. Graph Theory 67(3): 235-249 (2011) - Qizhong Lin, Yusheng Li:
Multicolor bipartite Ramsey number of C4 and large Kn, n. J. Graph Theory 67(1): 47-54 (2011) - Daphne Der-Fen Liu, Serguei Norine, Zhishi Pan, Xuding Zhu:
Circular consecutive choosability of k-choosable graphs. J. Graph Theory 67(3): 178-197 (2011) - Allan Siu Lun Lo:
Constrained Ramsey numbers for rainbow matching. J. Graph Theory 67(2): 91-95 (2011) - Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen:
Independence, odd girth, and average degree. J. Graph Theory 67(2): 96-111 (2011) - Iain Moffatt:
A characterization of partially dual graphs. J. Graph Theory 67(3): 198-217 (2011) - Bojan Mohar, Andrej Vodopivec:
The genus of Petersen powers. J. Graph Theory 67(1): 1-8 (2011) - Katsuhiro Ota, Michael D. Plummer, Akira Saito:
Forbidden triples for perfect matchings. J. Graph Theory 67(3): 250-259 (2011) - Dmitry A. Shabanov:
On a generalization of Rubin's theorem. J. Graph Theory 67(3): 226-234 (2011) - Gurusamy Rengasamy Vijayakumar:
Equivalence of four descriptions of generalized line graphs. J. Graph Theory 67(1): 27-33 (2011) - Gábor Wiener, Makoto Araya:
On planar hypohamiltonian graphs. J. Graph Theory 67(1): 55-68 (2011) - Huajun Zhang:
Primitivity and independent sets in direct products of vertex-transitive graphs. J. Graph Theory 67(3): 218-225 (2011)
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-24 06:25 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