Остановите войну!
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 43 matches
- 2017
- Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B 122: 815-843 (2017) - Christian Avart, Bill Kay, Christian Reiher, Vojtech Rödl:
The chromatic number of finite type-graphs. J. Comb. Theory B 122: 877-896 (2017) - Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell:
Antistrong digraphs. J. Comb. Theory B 122: 68-90 (2017) - Patrick Bennett, Andrzej Dudek:
On the Ramsey-Turán number with small s-independence number. J. Comb. Theory B 122: 690-718 (2017) - Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi:
Decomposing highly edge-connected graphs into paths of any given length. J. Comb. Theory B 122: 508-542 (2017) - Johannes Carmesin, J. Pascal Gollin:
Canonical tree-decompositions of a graph that display its k-blocks. J. Comb. Theory B 122: 1-20 (2017) - Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. J. Comb. Theory B 122: 741-756 (2017) - Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong:
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs. J. Comb. Theory B 122: 167-186 (2017) - Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. J. Comb. Theory B 122: 757-775 (2017) - Dennis Clemens, Julia Ehrenmüller, Alexey Pokrovskiy:
On sets not belonging to algebras and rainbow matchings in graphs. J. Comb. Theory B 122: 109-120 (2017) - Dennis Clemens, Anita Liebenau:
A non-trivial upper bound on the threshold bias of the Oriented-cycle game. J. Comb. Theory B 122: 21-54 (2017) - Vincent Cohen-Addad, Michael Hebdige, Daniel Král', Zhentao Li, Esteban Salgado:
Steinberg's Conjecture is false. J. Comb. Theory B 122: 452-456 (2017) - David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ordered Ramsey numbers. J. Comb. Theory B 122: 353-383 (2017) - James Cruickshank, Derek Kitson, Stephen C. Power:
The generic rigidity of triangulated spheres with blocks and holes. J. Comb. Theory B 122: 550-577 (2017) - Louis DeBiasio, Luke L. Nelsen:
Monochromatic cycle partitions of graphs with large minimum degree. J. Comb. Theory B 122: 634-667 (2017) - Matt DeVos, Edita Rollová, Robert Sámal:
A new proof of Seymour's 6-flow theorem. J. Comb. Theory B 122: 187-195 (2017) - Ted Dobson, Pablo Spiga:
Cayley numbers with arbitrarily many distinct prime factors. J. Comb. Theory B 122: 301-310 (2017) - Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski, Matas Sileikis:
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. J. Comb. Theory B 122: 719-740 (2017) - Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory B 122: 311-352 (2017) - John Engbers, David J. Galvin:
Extremal H-colorings of trees and 2-connected graphs. J. Comb. Theory B 122: 800-814 (2017) - Asaf Ferber, Michael Krivelevich, Benny Sudakov:
Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory B 122: 196-220 (2017) - Peter Frankl:
A stability result for the Katona theorem. J. Comb. Theory B 122: 869-876 (2017) - Jonas Hägglund, Arthur Hoffmann-Ostenhof:
Construction of permutation snarks. J. Comb. Theory B 122: 55-67 (2017) - Simon Hampe:
The intersection ring of matroids. J. Comb. Theory B 122: 578-614 (2017) - Adam Kabela, Tomás Kaiser:
10-tough chordal graphs are Hamiltonian. J. Comb. Theory B 122: 417-427 (2017) - Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager:
On the Corrádi-Hajnal theorem and a question of Dirac. J. Comb. Theory B 122: 121-148 (2017) - Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows II: Trees. J. Comb. Theory B 122: 457-478 (2017) - John Maharry, Neil Robertson, Vaidy Sivaraman, Daniel C. Slilaty:
Flexibility of projective-planar embeddings. J. Comb. Theory B 122: 241-300 (2017) - Dániel Marx, Paul D. Seymour, Paul Wollan:
Rooted grid minors. J. Comb. Theory B 122: 428-437 (2017) - Martin Merker:
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree. J. Comb. Theory B 122: 91-108 (2017)
skipping 13 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-07-21 18:31 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