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 33 matches
- 2013
- Peter Allen, Graham R. Brightwell, Jozef Skokan:
Ramsey-goodness - and otherwise. Comb. 33(2): 125-160 (2013) - Omid Amini, Louis Esperet, Jan van den Heuvel:
A unified approach to distance-two colouring of graphs on surfaces. Comb. 33(3): 253-296 (2013) - Antonio Avilés, Stevo Todorcevic:
Finite basis for analytic strong n-gaps. Comb. 33(4): 375-393 (2013) - Christine Bachoc, Arnaud Pêcher, Alain Thiéry:
On the theta number of powers of cycle graphs. Comb. 33(3): 297-317 (2013) - Alexander I. Barvinok:
A bound for the number of vertices of a polytope with applications. Comb. 33(1): 1-10 (2013) - Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
Lines in hypergraphs. Comb. 33(6): 633-654 (2013) - Joshua Browning, Douglas S. Stones, Ian M. Wanless:
Bounds on the number of autotopisms and subsquares of a Latin square. Comb. 33(1): 11-22 (2013) - David K. Butler:
A characterisation of the planes meeting a non-singular quadric of PG(4, Q) in a conic. Comb. 33(2): 161-179 (2013) - Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). Comb. 33(6): 655-697 (2013) - Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan:
Circumference, chromatic number and online coloring. Comb. 33(3): 319-334 (2013) - Zdenek Dvorák, Bojan Mohar:
Chromatic number and complete graph substructures for degree sequences. Comb. 33(5): 513-529 (2013) - Jacob Fox, Choongbum Lee, Benny Sudakov:
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. Comb. 33(2): 181-197 (2013) - Dániel Gerbner:
Profile polytopes of some classes of families. Comb. 33(2): 199-216 (2013) - Yahya Ould Hamidoune:
Two inverse results. Comb. 33(2): 217-230 (2013) - Viktor Harangi:
On the density of triangles and squares in regular finite and unimodular random graphs. Comb. 33(5): 531-548 (2013) - Stephen Huggett, Iain Moffatt:
Bipartite partial duals and circuits in medial graphs. Comb. 33(2): 231-252 (2013) - Jakub Jasinski:
Ramsey degrees of boron tree structures. Comb. 33(1): 23-44 (2013) - Naonori Kakimura, Ken-ichi Kawarabayashi:
Half-integral packing of odd cycles through prescribed vertices. Comb. 33(5): 549-572 (2013) - Peter Keevash, Benny Sudakov, Jacques Verstraëte:
On a conjecture of Erdős and Simonovits: Even cycles. Comb. 33(6): 699-732 (2013) - Nathan Keller, Guy Kindler:
Quantitative relation between noise sensitivity and influences. Comb. 33(1): 45-71 (2013) - Gábor Kun:
Constraints, MMSNP and expander relational structures. Comb. 33(3): 335-347 (2013) - James R. Lee, Anastasios Sidiropoulos:
Pathwidth, trees, and random embeddings. Comb. 33(3): 349-374 (2013) - Eoin Long:
Long paths and cycles in subgraphs of the cube. Comb. 33(4): 395-428 (2013) - Romanos-Diogenes Malikiosis:
Lattice-point enumerators of ellipsoids. Comb. 33(6): 733-744 (2013) - Jens Marklof, Andreas Strömbergsson:
Diameters of random circulant graphs. Comb. 33(4): 429-466 (2013) - Dragan Masulovic:
Some classes of finite homomorphism-homogeneous point-line geometries. Comb. 33(5): 573-590 (2013) - Bojan Mohar, Gábor Simonyi, Gábor Tardos:
Local chromatic number of quadrangulations of surfaces. Comb. 33(4): 467-495 (2013) - Dhruv Mubayi:
Counting substructures II: Hypergraphs. Comb. 33(5): 591-612 (2013) - Wesley Pegden:
Critical graphs without triangles: An optimum density construction. Comb. 33(4): 495-513 (2013) - Carsten Schultz:
Paths of homomorphisms from stable Kneser graphs. Comb. 33(5): 613-621 (2013)
skipping 3 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-12-23 22:25 CET 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