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 109 matches
- 2015
- Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma:
What Graphs are 2-Dot Product Graphs? Electron. Notes Discret. Math. 49: 705-711 (2015) - Elad Aigner-Horev, Hiêp Hàn:
Arithmetic progressions with a pseudorandom step. Electron. Notes Discret. Math. 49: 447-455 (2015) - Ilia Akolzin, Dmitry A. Shabanov:
Colorings of hypergraphs with large number of colors. Electron. Notes Discret. Math. 49: 407-411 (2015) - Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft:
Tight Cycles in Hypergraphs. Electron. Notes Discret. Math. 49: 675-682 (2015) - Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft:
Regular slices for hypergraphs. Electron. Notes Discret. Math. 49: 691-698 (2015) - Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz:
Local resilience of spanning subgraphs in sparse random graphs. Electron. Notes Discret. Math. 49: 513-521 (2015) - Peter Allen, Julia Böttcher, Barnaby Roberts, Yoshiharu Kohayakawa:
Triangle-Free Subgraphs of Random Graphs. Electron. Notes Discret. Math. 49: 393-397 (2015) - Peter Allen, Barnaby Roberts, Jozef Skokan:
Ramsey Numbers of Squares of Paths. Electron. Notes Discret. Math. 49: 637-641 (2015) - Noga Alon, Clara Shikhelman:
Many T copies in H-free graphs. Electron. Notes Discret. Math. 49: 683-689 (2015) - Martin Balko, Josef Cibulka, Karel Král, Jan Kyncl:
Ramsey numbers of ordered graphs. Electron. Notes Discret. Math. 49: 419-424 (2015) - Martin Balko, Pavel Valtr:
A SAT attack on the Erdős-Szekeres conjecture. Electron. Notes Discret. Math. 49: 425-431 (2015) - József Balogh, Hong Liu, Maryam Sharifzadeh, Andrew Treglown:
A sharp bound on the number of maximal sum-free sets. Electron. Notes Discret. Math. 49: 57-64 (2015) - Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus:
Edge-decompositions of graphs with high minimum degree. Electron. Notes Discret. Math. 49: 115-121 (2015) - Gill Barequet, Ronnie Barequet:
An Improved Upper Bound on the Growth Constant of Polyominoes. Electron. Notes Discret. Math. 49: 167-172 (2015) - Gill Barequet, Mira Shalah:
Automatic Proofs for Formulae Enumerating Proper Polycubes. Electron. Notes Discret. Math. 49: 145-151 (2015) - Julien Bensmail, Marthe Bonamy, Hervé Hocquard:
Strong edge coloring sparse graphs. Electron. Notes Discret. Math. 49: 773-778 (2015) - Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Induced minors and well-quasi-ordering. Electron. Notes Discret. Math. 49: 197-201 (2015) - Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle:
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. 49: 559-568 (2015) - Katerina Böhmová, Cristina Dalfó, Clemens Huemer:
The Diameter of Cyclic Kautz Digraphs. Electron. Notes Discret. Math. 49: 323-330 (2015) - Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi:
Path decompositions of regular graphs with prescribed girth. Electron. Notes Discret. Math. 49: 629-636 (2015) - Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi:
Decompositions of highly connected graphs into paths of any given length. Electron. Notes Discret. Math. 49: 795-802 (2015) - Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Split Graphs. Electron. Notes Discret. Math. 49: 497-503 (2015) - Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus:
4-colorability of P6-free graphs. Electron. Notes Discret. Math. 49: 37-42 (2015) - Henning Bruhn, Laura Gellert, Jacob Günther:
Jacobsthal numbers in generalised Petersen graphs. Electron. Notes Discret. Math. 49: 465-472 (2015) - Henning Bruhn, Felix Joos:
A stronger bound for the strong chromatic index. Electron. Notes Discret. Math. 49: 277-284 (2015) - Sergio Cabello, Bojan Mohar, Robert Sámal:
Drawing a disconnected graph on the torus (Extended abstract). Electron. Notes Discret. Math. 49: 779-786 (2015) - Márcia R. Cerioli, Taísa L. Martins:
Structural Results for General Partition, Equistable and Triangle graphs. Electron. Notes Discret. Math. 49: 713-718 (2015) - Shuya Chiba, Nicolas Lichiardopol:
Vertex-disjoint subgraphs with high degree sums. Electron. Notes Discret. Math. 49: 359-366 (2015) - Huda Chuangpishit, Mahya Ghandehari, Jeannette C. M. Janssen:
Uniform Linear Embeddings of Spatial Random Graphs. Electron. Notes Discret. Math. 49: 541-547 (2015) - Dennis Clemens, Mirjana Mikalacki:
Winning fast in fair biased Maker-Breaker games. Electron. Notes Discret. Math. 49: 353-358 (2015)
skipping 79 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-02 04:27 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