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 154 matches
- 2012
- Marién Abreu, Domenico Labbate, John Sheehan:
Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs. Eur. J. Comb. 33(8): 1847-1856 (2012) - Carmen Amarra, Michael Giudici, Cheryl E. Praeger:
Quotient-complete arc-transitive graphs. Eur. J. Comb. 33(8): 1857-1881 (2012) - M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter:
Counting s(3+1)-avoiding permutations. Eur. J. Comb. 33(1): 49-61 (2012) - Philippe Aubry, Annick Valibouze:
Algebraic computation of resolvents without extraneous powers. Eur. J. Comb. 33(7): 1369-1385 (2012) - Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho:
Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. 33(3): 294-301 (2012) - Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
The colorful Helly theorem and general hypergraphs. Eur. J. Comb. 33(5): 743-749 (2012) - Bruce Bates, Martin W. Bunder, Keith P. Tognetti:
Child's addition in the Stern-Brocot tree. Eur. J. Comb. 33(2): 148-167 (2012) - Olivier Bernardi, Juanjo Rué:
Enumerating simplicial decompositions of surfaces with boundaries. Eur. J. Comb. 33(3): 302-325 (2012) - Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33(7): 1386-1401 (2012) - Valérie Berthé, Dirk Frettlöh, Víctor F. Sirvent:
Selfdual substitutions in dimension one. Eur. J. Comb. 33(6): 981-1000 (2012) - Mariagrazia Bianchi, Marcel Herzog, Emanuele Pacifici, Giulio Saffirio:
On the regularity of a graph related to conjugacy classes of groups. Eur. J. Comb. 33(7): 1402-1407 (2012) - Jonah Blasiak:
An insertion algorithm for catabolizability. Eur. J. Comb. 33(2): 267-276 (2012) - Ievgen V. Bondarenko, Tullio Ceccherini-Silberstein, Alfredo Donno, Volodymyr Nekrashevych:
On a family of Schreier graphs of intermediate growth associated with a self-similar group. Eur. J. Comb. 33(7): 1408-1421 (2012) - Andries E. Brouwer, Oktay Olmez, Sung-Yell Song:
Directed strongly regular graphs from -designs. Eur. J. Comb. 33(6): 1174-1177 (2012) - Henning Bruhn, Paul Wollan:
Finite connectivity in infinite matroids. Eur. J. Comb. 33(8): 1900-1912 (2012) - Alexander I. Bufetov, Alexey Klimenko:
On Markov operators and ergodic theorems for group actions. Eur. J. Comb. 33(7): 1427-1443 (2012) - Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao:
Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5): 688-711 (2012) - Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversals and domination in uniform hypergraphs. Eur. J. Comb. 33(1): 62-72 (2012) - Wuxing Cai, Naihuan Jing:
Applications of a Laplace-Beltrami operator for Jack polynomials. Eur. J. Comb. 33(4): 556-571 (2012) - Peter J. Cameron, Maximilien Gadouleau:
Remoteness of permutation codes. Eur. J. Comb. 33(6): 1273-1285 (2012) - Leonardo Cangelmi:
A Riemann-Roch theorem for hypermaps. Eur. J. Comb. 33(7): 1444-1448 (2012) - Carl Johan Casselgren:
Coloring graphs from random lists of size 2. Eur. J. Comb. 33(2): 168-181 (2012) - Tullio Ceccherini-Silberstein:
Preface. Eur. J. Comb. 33(7): 1325-1329 (2012) - Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp:
Groups, graphs, languages, automata, games and second-order monadic logic. Eur. J. Comb. 33(7): 1330-1368 (2012) - Tullio Ceccherini-Silberstein, Wolfgang Woess:
Context-free pairs of groups I: Context-free pairs and graphs. Eur. J. Comb. 33(7): 1449-1466 (2012) - Vanessa Chatelain, Jorge L. Ramírez Alfonsín:
The switching game on unions of oriented matroids. Eur. J. Comb. 33(2): 215-219 (2012) - William Y. C. Chen, Daniel K. Du, Charles B. Mei:
Combinatorial telescoping for an identity of Andrews on parity in partitions. Eur. J. Comb. 33(4): 510-518 (2012) - William Y. C. Chen, Neil J. Y. Fan, Alina F. Y. Zhao:
Partitions and partial matchings avoiding neighbor patterns. Eur. J. Comb. 33(4): 491-504 (2012) - Min Chen, André Raspaud, Weifan Wang:
Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33(5): 905-923 (2012) - Markus Chimani, Petr Hlinený, Petra Mutzel:
Vertex insertion approximates the crossing number of apex graphs. Eur. J. Comb. 33(3): 326-335 (2012)
skipping 124 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-01 13:50 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