default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 11
Volume 11, Number 1, 2009
- Charlotte A. C. Brennan, Arnold Knopfmacher
:
The distribution of ascents of size d or more in compositions. 1-10 - Elmar Teufl, Stephan G. Wagner:
Asymptotic enumeration on self-similar graphs with two boundary vertices. 11-32
- Alessandra Cherubini, Andrzej Kisielewicz, Brunetto Piochi:
On the length of shortest 2-collapsing words. 33-44
- Jeff Erickson, Ferran Hurtado, Pat Morin:
Centerpoint Theorems for Wedges. 45-54
- Shu-Chiuan Chang, Lung-Chi Chen:
Number of connected spanning subgraphs on the Sierpinski gasket. 55-78 - Yidong Sun, Zhiping Wang:
String Pattern Avoidance in Generalized Non-crossing Trees. 79-94 - Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
The Eulerian distribution on centrosymmetric involutions. 95-116
- Artur Szymanski, A. Pawel Wojda:
Self-complementing permutations of k-uniform hypergraphs. 117-124 - Raffaele Mosca:
Independent sets in (P6, diamond)-free graphs. 125-140
- Deshi Ye, Guochuan Zhang:
On-line extensible bin packing with unequal bin sizes. 141-152 - Valérie Berthé, Laurent Imbert:
Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System. 153-172
- Toufik Mansour:
Enumeration of words by the sum of differences between adjacent letters. 173-186
- Petr Gregor, Riste Skrekovski:
Long cycles in hypercubes with distant faulty vertices. 187-200
Volume 11, Number 2, 2009
- Michal Kolarz, Wlodzimierz Moczurad:
Directed figure codes are decidable. 1-14
- Gábor Bacsó, Zsolt Tuza:
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. 15-24 - Lech Adamus:
Edge condition for long cycles in bipartite graphs. 25-32 - Camino Balbuena:
A method for obtaining small regular bipartite graphs of girth 8. 33-46 - Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia:
On the Chromatic Number of some Flip Graphs. 47-56 - Janusz Adamus, Lech Adamus:
Ore and Erdős type conditions for long cycles in balanced bipartite graphs. 57-70 - Jing Kong, Yaokun Wu:
On economical set representations of graphs. 71-96 - Jan Foniok, Claude Tardif:
Adjoint functors and tree duality. 97-110
- Louis H. Kauffman, Pedro Lopes:
Determinants of Rational Knots. 111-122
- Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Codes Avoiding Matchings. 123-148 - Romain Boulet:
Spectral characterizations of sun graphs and broken sun graphs. 149-169
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.
last updated on 2026-04-29 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
