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 48 matches
- 2024
- Takuro Abe, Tan Nhat Tran, Shuhei Tsujie:
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish. Eur. J. Comb. 118: 103920 (2024) - Eyal Ackerman, Balázs Keszegh:
On the number of tangencies among 1-intersecting x-monotone curves. Eur. J. Comb. 118: 103929 (2024) - Yahav Alon, Michael Krivelevich:
Hamilton completion and the path cover number of sparse random graphs. Eur. J. Comb. 118: 103934 (2024) - Fadi Awik, Jadyn Breland, Quentin Cadman, Dana C. Ernst:
Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes. Eur. J. Comb. 118: 103931 (2024) - József Balogh, Ce Chen, Grace McCourt, Cassie Murley:
Ramsey-Turán problems with small independence numbers. Eur. J. Comb. 118: 103872 (2024) - János Barát, Zoltán L. Blázsik:
Improved upper bound on the Frank number of 3-edge-connected graphs. Eur. J. Comb. 118: 103913 (2024) - Malgorzata Bednarska-Bzdega:
Off-diagonal online size Ramsey numbers for paths. Eur. J. Comb. 118: 103873 (2024) - Manoj M. Belavadi, Kathie Cameron, Owen D. Merkel:
Reconfiguration of vertex colouring and forbidden induced subgraphs. Eur. J. Comb. 118: 103908 (2024) - Jan De Beule, Jonathan Mannaert, Valentino Smaldore:
Some non-existence results on m-ovoids in classical polar spaces. Eur. J. Comb. 118: 103943 (2024) - Jonathan S. Bloom, Dan Saracino:
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović. Eur. J. Comb. 118: 103898 (2024) - Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
The rotation distance of brooms. Eur. J. Comb. 118: 103877 (2024) - Dustin Cartwright, Dony Varghese:
Characteristic sets of matroids. Eur. J. Comb. 118: 103939 (2024) - Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang:
The spectral radius of minor-free graphs. Eur. J. Comb. 118: 103875 (2024) - Xinbu Cheng, Meiqin Wang, Zixiang Xu, Chi Hoi Yip:
Exact values and improved bounds on k-neighborly families of boxes. Eur. J. Comb. 118: 103926 (2024) - Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak:
Online coloring of short intervals. Eur. J. Comb. 118: 103919 (2024) - Gabriel Currier, József Solymosi, Ethan Patrick White:
Additive structure in convex translates. Eur. J. Comb. 118: 103889 (2024) - Samantha L. Dahlberg, Hemanshu Kaul, Jeffrey A. Mudrock:
An algebraic approach for counting DP-3-colorings of sparse graphs. Eur. J. Comb. 118: 103890 (2024) - John J. Ebert, David J. Grynkiewicz:
Structure of a sequence with prescribed zero-sum subsequences: Rank two p-groups. Eur. J. Comb. 118: 103888 (2024) - Richard Ehrenborg:
The Ehrhart and face polynomials of the graph polytope of a cycle. Eur. J. Comb. 118: 103906 (2024) - Sean English, Jürgen Kritschgau, Mina Nahvi, Elizabeth Sprangel:
Saturation numbers for Berge cliques. Eur. J. Comb. 118: 103911 (2024) - Victor Falgas-Ravry:
On an extremal problem for locally sparse multigraphs. Eur. J. Comb. 118: 103887 (2024) - Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev:
Max-norm Ramsey theory. Eur. J. Comb. 118: 103918 (2024) - Peter Frankl, Jian Wang:
Improved bounds on the maximum diversity of intersecting families. Eur. J. Comb. 118: 103885 (2024) - Delia Garijo, Andrew J. Goodall, Lluís Vena:
Homomorphisms between graphs embedded in surfaces. Eur. J. Comb. 118: 103936 (2024) - Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, Máté Vizer:
Stability of extremal connected hypergraphs avoiding Berge-paths. Eur. J. Comb. 118: 103930 (2024) - Adam Gowty, Daniel Horsley, Adam Mammoliti:
Minimising the total number of subsets and supersets. Eur. J. Comb. 118: 103882 (2024) - Max Hahn-Klimroth, Olaf Parczyk, Yury Person:
Minimum degree conditions for containing an r-regular r-connected spanning subgraph. Eur. J. Comb. 118: 103940 (2024) - Thomas Y. He, Kathy Q. Ji, Alice X. H. Zhao:
Overpartitions and Bressoud's conjecture, II. Eur. J. Comb. 118: 103937 (2024) - Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano:
On k-neighborly reorientations of oriented matroids. Eur. J. Comb. 118: 103938 (2024) - Emma Hogan, Charles Semple:
The excluded minors for the intersection of bicircular and lattice path matroids. Eur. J. Comb. 118: 103923 (2024)
skipping 18 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-10-22 02:00 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