Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 9
Volume 9, Number 1, 2002
- Yuejian Peng, Vojtech Rödl, Andrzej Rucinski:
Holes in Graphs. - Cheryl Grood:
A Specht Module Analog for the Rook Monoid. - Nicolas Pouyanne:
On the Number of Permutations Admitting an m-th Root. - Frank Van Bussel:
Relaxed Graceful Labellings of Trees. - Michael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist:
On Packing Densities of Permutations. - Francesc Comellas, J. Luis A. Yebra:
New Lower Bounds for Heilbronn Numbers. - William Duckworth:
Minimum Connected Dominating Sets of Random Cubic Graphs. - Vince Grolmusz:
Set-Systems with Restricted Multiple Intersections. - Evgeni Nedialkov, Nedyalko Dimov Nenov:
Computation of the Vertex Folkman Numbers F(2, 2, 2, 4;6) and F(2, 3, 4;6). - Henry Cohn, Robin Pemantle, James Gary Propp:
Generating a Random Sink-free Orientation in Quadratic Time. - Irène Charon, Olivier Hudry, Antoine Lobstein:
Identifying Codes with Small Radius in Some Infinite Regular Graphs. - Ian M. Wanless:
A Generalisation of Transversals for Latin Squares. - Aaron Robertson:
New Lower Bound Formulas for Multicolored Ramsey Numbers. - Michael J. Kearney
, Peter Shiu:
Efficient Packing of Unit Squares in a Square. - Keldon Drudge:
On the Orbits of Singer Groups and Their Subgroups. - Brett Stevens:
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order. - Xun Dong, Michelle L. Wachs:
Combinatorial Laplacian of the Matching Complex. - Martin Rubey:
A 'Nice' Bijection for a Content Formula for Skew Semistandard Young Tableaux. - Thomas Britz:
MacWilliams Identities and Matroid Polynomials. - Esaias J. Janse van Rensburg, Andrew Rechnitzer:
Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption. - Hélène Barcelo, Robert Maule, Sheila Sundaram:
On Counting Permutations by Pairs of Congruence Classes of Major Index. - Dennis E. Davenport, Neil Hindman, Dona Strauss:
Triangle Free Sets and Arithmetic Progressions - Two Pisier Type Problems. - Carmel Domshlak:
On Recursively Directed Hypercubes. - Marcel Erné, Jobst Heitzig, Jürgen Reinhold:
On the Number of Distributive Lattices. - Bill Casselman:
Computation in Coxeter Groups-I. Multiplication. - Avinash Dalal, Eric Schmutz:
Compositions of Random Functions on a Finite Set. - Michael Krivelevich:
Sparse Graphs Usually Have Exponentially Many Optimal Colorings. - James D. Currie, Jamie Simpson:
Non-Repetitive Tilings. - Greg Kuperberg:
Kasteleyn Cokernels. - Martin Loebl:
On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices. - Peter J. Cameron, Dudley Stark:
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property. - Petr Hlinený:
On the Excluded Minors for Matroids of Branch-Width Three. - Heinrich Niederhausen:
Catalan Traffic at the Beach. - Jeffrey B. Remmel, S. G. Williamson:
Spanning Trees and Function Classes. - Edward Dobson, Joy Morris:
Toida's Conjecture is True. - Edward E. Allen:
Bitableaux Bases for some Garsia-Haiman Modules and Other Related Modules. - Michael O. Albertson, Joan P. Hutchinson:
Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help. - Michael D. Plummer, Xiaoya Zha:
On the Connectivity of Graphs Embedded in Surfaces II. - Michael Kleber:
Linearly Independent Products of Rectangularly Complementary Schur Functions. - Bruno Courcelle, V. Dussaux:
Map Genus, Forbidden Maps, and Monadic Second-Order Logic. - Patric R. J. Östergård, Mattias Svanström:
Ternary Constant Weight Codes. - Dhruv Mubayi:
Generalizing the Ramsey Problem through Diameter. - Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald:
The Number of Labeled 2-Connected Planar Graphs. - Jaroslaw Grytczuk:
Thue-like Sequences and Rainbow Arithmetic Progressions. - Jair Donadelli, Yoshiharu Kohayakawa:
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall.
- Benny Sudakov:
A Note on Odd Cycle-Complete Graph Ramsey Numbers. - Peter J. Cameron:
Cycle Index, Weight Enumerator, and Tutte Polynomial. - Geoffrey Exoo:
A Small Trivalent Graph of Girth 14. - Herbert Fleischner, Robert R. Molina, Ken W. Smith, Douglas B. West:
A Proof of the Two-path Conjecture. - John R. Stembridge:
A Concise Proof of the Littlewood-Richardson Rule. - Jian Shen, Raphael Yuster:
A Note on the Number of Edges Guaranteeing a C4 in Eulerian Bipartite Digraphs. - Philippe Biane:
Parking Functions of Types A and B. - Garth Isaak:
Sum List Coloring 2*n Arrays. - Alexandr V. Kostochka:
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs. - James D. Currie:
There Are Ternary Circular Square-Free Words of Length n for n >= 18. - Ioan Tomescu:
Irreducible Coverings by Cliques and Sperner's Theorem.
Volume 9, Number 2, 2002
Special Volume on Permutation Patterns
- Peter A. Hästö:
The Packing Density of Other Layered Permutations. - Peter J. Cameron:
Homogeneous Permutations. - Alexander Burstein, Toufik Mansour:
Words Restricted by Patterns with at Most 2 Distinct Letters. - Joseph Samuel Myers:
The Minimum Number of Monotone Subsequences. - Toufik Mansour, Zvezdelina Stankova:
321-Polygon-Avoiding Permutations and Chebyshev Polynomials. - Vincent R. Vatter:
Permutations Avoiding Two Patterns of Length Three. - Eric S. Egge, Toufik Mansour:
Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials. - Astrid Reifegerste:
On the Diagram of Schröder Permutations. - Michael H. Albert, Mike D. Atkinson:
Sorting with a Forklift. - Tomás Kaiser, Martin Klazar:
On Growth Rates of Closed Permutation Classes. - Catalin Zara:
Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph. - Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf:
Longest Increasing Subsequences in Pattern-Restricted Permutations. - Darko Marinov, Rados Radoicic:
Counting 1324-Avoiding Permutations. - Astrid Reifegerste:
A Generalization of Simion-Schmidt's Bijection for Restricted Permutations. - William Y. C. Chen, Eva Yu-Ping Deng, Laura L. M. Yang:
Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns. - Aaron D. Jaggard:
Prefix Exchanging and Pattern Avoidance by Involutions. - Maximillian M. Murphy, Vincent R. Vatter:
Profile Classes and Partial Well-Order for Permutations. - Antoine Vella:
Pattern Avoidance in Permutations: Linear and Cyclic Orders. - Mireille Bousquet-Mélou:
Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels. - Alexander Burstein, Peter A. Hästö, Toufik Mansour:
Packing Patterns into Words.
- Miklós Bóna:
A Survey of Stack-Sorting Disciplines.
a service of 
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 2024-04-25 05:29 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:
