default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 10
Volume 10, 2003
- Frank Ruskey
, Joe Sawada:
Bent Hamilton Cycles in d-Dimensional Grid Graphs. - Francesc Aguiló, Ester Simó, Marisa Zaragozá:
Optimal Double-Loop Networks with Non-Unit Steps. - Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
The Cube Polynomial and its Derivatives: the Case of Median Graphs. - Neil J. Calkin, Criel Merino, Steven D. Noble, Marc Noy:
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. - Rui Xu, Cun-Quan Zhang:
Nowhere-Zero 3-Flows in Squares of Graphs. - David Cariolaro, Gianfranco L. Cariolaro:
Colouring the Petals of a Graph. - Petri Rosendahl:
On the Identification of Vertices Using Cycles. - Walter Stromquist:
Packing 10 or 11 Unit Squares in a Square. - Karen S. Briggs, Jeffrey B. Remmel:
A p, q-analogue of a Formula of Frobenius. - Michael J. Schlosser:
Inversion of Bilateral Basic Hypergeometric Series. - Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf:
On k-Ordered Bipartite Graphs. - Gregory Kucherov, Pascal Ochem, Michaël Rao:
How Many Square Occurrences Must a Binary Sequence Contain? - Andrew V. Sills:
Finite Rogers-Ramanujan Type Identities. - W. Zudilin:
An Apery-like Difference Equation for Catalan's Constant. - Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf:
A Discontinuity in the Distribution of Fixed Point Sums. - Eric S. Egge, James Haglund, Kendra Killpatrick, Darla Kremer:
A Schröder Generalization of Haglund's Statistic on Catalan Paths. - Leif K. Jørgensen, Mikhail H. Klin:
Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices. - Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits:
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. - Johann Cigler:
A New Class of q-Fibonacci Polynomials. - Terry A. McKee:
The Neighborhood Characteristic Parameter for Graphs. - Sergey Agievich:
Two-Stage Allocations and the Double Q-Function. - Mihail N. Kolountzakis:
Translational Tilings of the Integers with Long Periods. - Yurii Burman, Michael Shapiro:
Coding Parking Functions by Pairs of Permutations. - E. Strahov:
Moments of Characteristic Polynomials Enumerate Two-Rowed Lexicographic Arrays. - Felix Lazebnik, Jacques Verstraëte:
On Hypergraphs of Girth Five. - Jian Shen:
Short Cycles in Digraphs with Local Average Outdegree at Least Two. - Luis A. Goddyn, Pavol Gvozdjak:
Binary Gray Codes with Long Bit Runs. - Yuliya Gryshko:
Monochrome Symmetric Subsets in 2-Colorings of Groups. - Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó:
On Randomly Generated Intersecting Hypergraphs. - Andreas Blass:
Homotopy and Homology of Finite Lattices. - Edward Dobson:
Some Non-Normal Cayley Digraphs of the Generalized Quaternion Group of Certain Orders. - Yair Caro, Raphael Yuster:
The Order of Monochromatic Subgraphs with a Given Minimum Degree. - Oliver D. King:
Bounds for DNA Codes with Constant GC-Content. - Victor J. W. Guo:
The q-Binomial Theorem and two Symmetric q-Identities. - Richard Brak, John W. Essam:
Bicoloured Dyck Paths and the Contact Polynomial for n Non-Intersecting Paths in a Half-Plane Lattice. - Graham C. Denham:
Short Generating Functions for some Semigroup Algebras. - Nigel Martin, Richard Stong:
Permutation Separations and Complete Bipartite Factorisations of K_{n, n}. - Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling:
Skolem-type Difference Sets for Cycle Systems. - Andrzej Czygrinow, Brendan Nagle:
Matrix-Free Proof of a Regularity Characterization. - Edward A. Bender, J. William Helton, L. Bruce Richmond:
Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls. - David Arthur:
The Restricted Arc-Width of a Graph. - Dhruv Mubayi, Yi Zhao:
On a Two-Sided Turan Problem. - Ioana Dumitriu, Etienne Rassart:
Path Counting and Random Matrix Theory. - Yulia Kempner, Vadim E. Levit:
Correspondence between two Antimatroid Algorithmic Characterizations. - Ilse Fischer, Charles H. C. Little:
Even Circuits of Prescribed Clockwise Parity. - C. R. Subramanian:
Finding Induced Acyclic Subgraphs in Random Digraphs. - Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning:
Global Defensive Alliances in Graphs.
- Maria Axenovich:
A Note on Graph Coloring Extensions and List-Colorings. - Ping Wang, Baoguang Xu, Jianfang Wang:
A Note on the Edge-Connectivity of Cages. - Jørn B. Olsson:
Regular Character Tables of Symmetric Groups. - Achim Flammenkamp, Arthur Holshouser, Harold Reiter:
Dynamic One-Pile Blocking Nim. - Zoran Sunik:
Self-Describing Sequences and the Catalan Family Tree. - Jörn Quistorff:
Some Remarks on the Plotkin Bound. - Arthur Holshouser, Harold Reiter:
One Pile Nim with Arbitrary Move Function. - Nagi H. Nahas:
On the Crossing Number of K{m, n}. - Thomas Böhme, Bojan Mohar:
Domination, Packing and Excluded Minors. - Dhruv Mubayi:
On Hypergraphs with Every Four Points Spanning at Most Two Triples. - Gordon F. Royle:
The Rank of a Cograph. - Ojas Parekh:
Forestation in Hypergraphs: Linear k-Trees. - David S. Hough:
Descents in Noncrossing Trees.
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 2025-02-04 21:05 CET 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:
