Остановите войну!
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
- 2004
- Dan Archdeacon, C. Paul Bonnington:
Obstructions for embedding cubic graphs on the spindle surface. J. Comb. Theory, Ser. B 91(2): 229-252 (2004) - József Balogh, Béla Bollobás, Miklós Simonovits:
The number of graphs without forbidden subgraphs. J. Comb. Theory, Ser. B 91(1): 1-24 (2004) - Yair Caro, Raphael Yuster:
Edge coloring complete uniform hypergraphs with many components. J. Comb. Theory, Ser. B 91(2): 215-227 (2004) - Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory, Ser. B 91(1): 25-41 (2004) - Xiaotie Deng, Guojun Li, Wenan Zang:
Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs. J. Comb. Theory, Ser. B 91(2): 301-325 (2004) - Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei:
Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory, Ser. B 91(1): 43-55 (2004) - James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle:
A short proof of non-GF(5)-representability of matroids. J. Comb. Theory, Ser. B 91(1): 105-121 (2004) - Fred C. Holroyd, Martin Koviera:
Colouring of cubic graphs by Steiner triple systems. J. Comb. Theory, Ser. B 91(1): 57-66 (2004) - Iiro S. Honkala, Tero Laihonen:
On identification in the triangular grid. J. Comb. Theory, Ser. B 91(1): 67-86 (2004) - Shlomo Hoory, Nathan Linial:
Colorings of the d-regular infinite tree. J. Comb. Theory, Ser. B 91(2): 161-167 (2004) - Tamás Király:
Covering symmetric supermodular functions by uniform hypergraphs. J. Comb. Theory, Ser. B 91(2): 185-200 (2004) - Vladimir P. Korzhik, Heinz-Jürgen Voss:
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. J. Comb. Theory, Ser. B 91(2): 253-287 (2004) - Mark S. MacLean:
Taut distance-regular graphs of even diameter. J. Comb. Theory, Ser. B 91(1): 127-142 (2004) - Hirobumi Mizuno, Iwao Sato:
Weighted zeta functions of graphs. J. Comb. Theory, Ser. B 91(2): 169-183 (2004) - Serguei Norine, Charles H. C. Little, Kee L. Teo:
A new proof of a characterisation of Pfaffian bipartite graphs. J. Comb. Theory, Ser. B 91(1): 123-126 (2004) - Gyula Pap, László Szegö:
On the maximum even factor in weakly symmetric graphs. J. Comb. Theory, Ser. B 91(2): 201-213 (2004) - Primoz Potocnik:
Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms. J. Comb. Theory, Ser. B 91(2): 289-300 (2004) - Gordon F. Royle, Alan D. Sokal:
The Brown-Colbourn conjecture on zeros of reliability polynomials is false. J. Comb. Theory, Ser. B 91(2): 345-360 (2004) - Dragan Stevanovic:
The largest eigenvalue of nonregular graphs. J. Comb. Theory, Ser. B 91(1): 143-146 (2004) - Mark E. Watkins, Jack E. Graver:
A characterization of infinite planar primitive graphs. J. Comb. Theory, Ser. B 91(1): 87-104 (2004) - Xiangqian Zhou:
On internally 4-connected non-regular binary matroids. J. Comb. Theory, Ser. B 91(2): 327-343 (2004)
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-31 05:36 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