Остановите войну!
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 71 matches
- 2007
- Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé:
Paths with two blocks in n-chromatic digraphs. J. Comb. Theory, Ser. B 97(4): 620-626 (2007) - Isolde Adler:
Directed tree-width examples. J. Comb. Theory, Ser. B 97(5): 718-725 (2007) - Koenraad Audenaert, Chris D. Godsil, Gordon F. Royle, Terry Rudolph:
Symmetric squares of graphs. J. Comb. Theory, Ser. B 97(1): 74-90 (2007) - Robert Berke, Tibor Szabó:
Relaxed two-coloring of cubic graphs. J. Comb. Theory, Ser. B 97(4): 652-668 (2007) - Mark Bilinski, Young Soo Kwon, Xingxing Yu:
On the reconstruction of planar graphs. J. Comb. Theory, Ser. B 97(5): 745-756 (2007) - Türker Bíyíkoglu, Josef Leydold:
Faber-Krahn type inequalities for trees. J. Comb. Theory, Ser. B 97(2): 159-174 (2007) - Jonah Blasiak:
A special case of Hadwiger's conjecture. J. Comb. Theory, Ser. B 97(6): 1056-1073 (2007) - Drago Bokal:
On the crossing numbers of Cartesian products with paths. J. Comb. Theory, Ser. B 97(3): 381-384 (2007) - Béla Bollobás, Vladimir Nikiforov:
Cliques and the spectral radius. J. Comb. Theory, Ser. B 97(5): 859-865 (2007) - Béla Bollobás, Alex D. Scott:
Separating systems and oriented graphs of diameter two. J. Comb. Theory, Ser. B 97(2): 193-203 (2007) - Daniel R. L. Brown, David M. Jackson:
A rooted map invariant, non-orientability and Jack symmetric functions. J. Comb. Theory, Ser. B 97(3): 430-452 (2007) - Boris Bukh, Benny Sudakov:
Induced subgraphs of Ramsey graphs with many distinct degrees. J. Comb. Theory, Ser. B 97(4): 612-619 (2007) - L. Sunil Chandran, Naveen Sivadasan:
Boxicity and treewidth. J. Comb. Theory, Ser. B 97(5): 733-744 (2007) - Victor Chepoi:
Basis graphs of even Delta-matroids. J. Comb. Theory, Ser. B 97(2): 175-192 (2007) - Gregory L. Cherlin, Saharon Shelah:
Universal graphs with a forbidden subtree. J. Comb. Theory, Ser. B 97(3): 293-333 (2007) - Maria Chudnovsky, Paul D. Seymour:
The roots of the independence polynomial of a clawfree graph. J. Comb. Theory, Ser. B 97(3): 350-357 (2007) - Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. I. Orientable prismatic graphs. J. Comb. Theory, Ser. B 97(6): 867-903 (2007) - Sebastian M. Cioaba, David A. Gregory, Vladimir Nikiforov:
Extreme eigenvalues of nonregular graphs. J. Comb. Theory, Ser. B 97(3): 483-486 (2007) - Marston D. E. Conder, Robert Jajcay, Thomas W. Tucker:
Regular t-balanced Cayley maps. J. Comb. Theory, Ser. B 97(3): 453-473 (2007) - Marston D. E. Conder, Roman Nedela:
Symmetric cubic graphs of small girth. J. Comb. Theory, Ser. B 97(5): 757-768 (2007) - Colin Cooper, Alan M. Frieze:
The cover time of the preferential attachment graph. J. Comb. Theory, Ser. B 97(2): 269-290 (2007) - Bruno Courcelle, Sang-il Oum:
Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory, Ser. B 97(1): 91-126 (2007) - Edward Dobson, Aleksander Malnic, Dragan Marusic, Lewis A. Nowitz:
Semiregular automorphisms of vertex-transitive graphs of certain valencies. J. Comb. Theory, Ser. B 97(3): 371-380 (2007) - Feng Ming Dong, Khee Meng Koh:
Bounds for the coefficients of flow polynomials. J. Comb. Theory, Ser. B 97(3): 413-420 (2007) - Mark N. Ellingham, Ken-ichi Kawarabayashi:
2-Connected spanning subgraphs with low maximum degree in locally planar graphs. J. Comb. Theory, Ser. B 97(3): 401-412 (2007) - Mark N. Ellingham, D. Christopher Stephens:
The nonorientable genus of joins of complete graphs with large edgeless graphs. J. Comb. Theory, Ser. B 97(5): 827-845 (2007) - Enrique García Moreno Esteva, Tommy R. Jensen:
On semiextensions and circuit double covers. J. Comb. Theory, Ser. B 97(3): 474-482 (2007) - Yan-Quan Feng, Jin Ho Kwak:
Cubic symmetric graphs of order a small number times a prime or a prime square. J. Comb. Theory, Ser. B 97(4): 627-646 (2007) - Agnieszka Figaj, Tomasz Luczak:
The Ramsey number for a triple of long even cycles. J. Comb. Theory, Ser. B 97(4): 584-596 (2007) - Gasper Fijavz:
Contractions of 6-connected toroidal graphs. J. Comb. Theory, Ser. B 97(4): 553-570 (2007)
skipping 41 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-30 04:50 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