Остановите войну!
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 57 matches
- 2010
- Afredo Alzaga, Rodrigo Iglesias, Ricardo Pignol:
Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements. J. Comb. Theory, Ser. B 100(6): 671-682 (2010) - Olivier Bernardi, Marc Noy, Dominic Welsh:
Growth constants of minor-closed classes of graphs. J. Comb. Theory, Ser. B 100(5): 468-484 (2010) - Stéphane Bessy, Stéphan Thomassé:
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. J. Comb. Theory, Ser. B 100(2): 176-180 (2010) - Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliff Smyth:
Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100(3): 299-312 (2010) - Joseph E. Bonin:
Lattice path matroids: The excluded minors. J. Comb. Theory, Ser. B 100(6): 585-599 (2010) - Petter Brändén, Rafael S. González D'León:
On the half-plane property and the Tutte group of a matroid. J. Comb. Theory, Ser. B 100(5): 485-492 (2010) - Darryn E. Bryant:
Packing paths in complete graphs. J. Comb. Theory, Ser. B 100(2): 206-215 (2010) - Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
K4-free graphs with no odd holes. J. Comb. Theory, Ser. B 100(3): 313-331 (2010) - Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs VI. Colouring. J. Comb. Theory, Ser. B 100(6): 560-572 (2010) - Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi:
On the isoperimetric spectrum of graphs and its approximations. J. Comb. Theory, Ser. B 100(4): 390-412 (2010) - Andrzej Dudek, Vojtech Rödl:
An almost quadratic bound on vertex Folkman numbers. J. Comb. Theory, Ser. B 100(2): 132-140 (2010) - Zdenek Dvorák, Bojan Mohar:
Crossing-critical graphs with large maximum degree. J. Comb. Theory, Ser. B 100(4): 413-417 (2010) - Zdenek Dvorák, Bojan Mohar:
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. J. Comb. Theory, Ser. B 100(6): 729-739 (2010) - Zdenek Dvorák, Serguei Norine:
Small graph classes and bounded expansion. J. Comb. Theory, Ser. B 100(2): 171-175 (2010) - Jacob Fox, János Pach, Csaba D. Tóth:
A bipartite strengthening of the Crossing Lemma. J. Comb. Theory, Ser. B 100(1): 23-35 (2010) - Jim Geelen, Bert Gerards, Geoff Whittle:
On inequivalent representations of matroids over non-prime fields. J. Comb. Theory, Ser. B 100(6): 740-743 (2010) - Jim Geelen, Peter Nelson:
The number of points in a matroid with no n-point line as a minor. J. Comb. Theory, Ser. B 100(6): 625-630 (2010) - Jim Geelen, Geoff Whittle:
The projective plane is a stabilizer. J. Comb. Theory, Ser. B 100(2): 128-131 (2010) - Michael Giudici, Cai Heng Li:
On finite edge-primitive and edge-quasiprimitive graphs. J. Comb. Theory, Ser. B 100(3): 275-298 (2010) - Mike J. Grannell, Martin Knor:
A lower bound for the number of orientable triangular embeddings of some complete graphs. J. Comb. Theory, Ser. B 100(2): 216-225 (2010) - Robert Gray, Dugald Macpherson:
Countable connected-homogeneous graphs. J. Comb. Theory, Ser. B 100(2): 97-118 (2010) - Hiêp Hàn, Mathias Schacht:
Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Comb. Theory, Ser. B 100(3): 332-346 (2010) - Bill Jackson, Tibor Jordán:
Globally rigid circuits of the direction-length rigidity matroid. J. Comb. Theory, Ser. B 100(1): 1-22 (2010) - Gwenaël Joret, David R. Wood:
Irreducible triangulations are small. J. Comb. Theory, Ser. B 100(5): 446-455 (2010) - Aleksandar Jurisic, Paul M. Terwilliger, Arjana Zitnik:
The Q-polynomial idempotents of a distance-regular graph. J. Comb. Theory, Ser. B 100(6): 683-690 (2010) - Naonori Kakimura:
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem. J. Comb. Theory, Ser. B 100(6): 650-670 (2010) - Maciej Kalkowski, Michal Karonski, Florian Pfender:
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture. J. Comb. Theory, Ser. B 100(3): 347-349 (2010) - Peter Keevash, Benny Sudakov:
Pancyclicity of Hamiltonian and highly connected graphs. J. Comb. Theory, Ser. B 100(5): 456-467 (2010) - Luke Kelly, Daniela Kühn, Deryk Osthus:
Cycles of given length in oriented graphs. J. Comb. Theory, Ser. B 100(3): 251-264 (2010) - Martin Kochol:
Smallest counterexample to the 5-flow conjecture has girth at least eleven. J. Comb. Theory, Ser. B 100(4): 381-389 (2010)
skipping 27 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-28 16:12 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