Parcourir par

  • Collections
  • Sources

Geodesic


    Parcourir par

    • Collections
    • Sources
The electronic journal of combinatorics
Tome 10 (2003)
Précédent Suivant


Bent Hamilton cycles in \(d\)-dimensional grid graphs
F. Ruskey ; Joe Sawada

Optimal double-loop networks with non-unit steps
F. Aguiló ; E. Simó ; M. Zaragozá

The cube polynomial and its derivatives: The case of median graphs
Boštjan Brešar ; Sandi Klavžar ; Riste Škrekovski

Improved bounds for the number of forests and acyclic orientations in the square lattice
N. Calkin ; C. Merino ; S. Noble ; M. Noy

Nowhere-zero 3-flows in squares of graphs
Rui Xu ; Cun-Quan Zhang

Colouring the petals of a graph
David Cariolaro ; Gianfranco Cariolaro

On the identification of vertices using cycles
Petri Rosendahl

Packing 10 or 11 unit squares in a square
Walter Stromquist

A \(p,q\)-analogue of a formula of Frobenius
Karen S. Briggs ; Jeffrey B. Remmel

Inversion of bilateral basic hypergeometric series
Michael Schlosser

On \(k\)-ordered bipartite graphs
Jill R. Faudree ; Ronald J. Gould ; Florian Pfender ; Allison Wolf

How many square occurrences must a binary sequence contain?
Gregory Kucherov ; Pascal Ochem ; Michaël Rao

Finite Rogers-Ramanujan type identities
Andrew V. Sills

An Apéry-like difference equation for Catalan's constant
W. Zudilin

A discontinuity in the distribution of fixed point sums
Edward A. Bender ; E. Rodney Canfield ; L. Bruce Richmond ; Herbert S. Wilf

A Schröder generalization of Haglund's statistic on Catalan paths
E. S. Egge ; J. Haglund ; K. Killpatrick ; D. Kremer

Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
L. K. Jørgensen ; M. Klin

The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
Zoltán Füredi ; Oleg Pikhurko ; Miklós Simonovits

A new class of \(q\)-Fibonacci polynomials
Johann Cigler

The neighborhood characteristic parameter for graphs
Terry A. McKee

Two-stage allocations and the double \(Q\)-function
Sergey Agievich

Translational tilings of the integers with long periods
Mihail N. Kolountzakis

Coding parking functions by pairs of permutations
Yurii Burman ; Michael Shapiro

Moments of characteristic polynomials enumerate two-rowed lexicographic arrays
E. Strahov

On hypergraphs of girth five
Felix Lazebnik ; Jacques Verstraëte

Short cycles in digraphs with local average outdegree at least two
Jian Shen

Binary Gray codes with long bit runs
Luis Goddyn ; Pavol Gvozdjak

Monochrome symmetric subsets in \(2\)-colorings of groups
Yuliya Gryshko

On randomly generated intersecting hypergraphs
Tom Bohman ; Colin Cooper ; Alan Frieze ; Ryan Martin ; Miklós Ruszinkó

Homotopy and homology of finite lattices
Andreas Blass

Some non-normal Cayley digraphs of the generalized quaternion group of certain orders
Edward Dobson

The order of monochromatic subgraphs with a given minimum degree
Yair Caro ; Raphael Yuster

Bounds for DNA codes with constant GC-content
Oliver D. King

The \(q\)-binomial theorem and two symmetric \(q\)-identities
Victor J. W. Guo

Bicoloured Dyck paths and the contact polynomial for \(n\) non-intersecting paths in a half-plane lattice
R. Brak ; J. W. Essam

Short generating functions for some semigroup algebras
Graham Denham

Permutation separations and complete bipartite factorisations of \(K_{n,n}\)
Nigel Martin ; Richard Stong

Skolem-type difference sets for cycle systems
Darryn Bryant ; Heather Gavlas ; Alan C. H. Ling

Matrix-free proof of a regularity characterization
A. Czygrinow ; B. Nagle

Asymptotics of permutations with nearly periodic patterns of rises and falls
Edward A. Bender ; William J. Helton ; L. Bruce Richmond

The restricted arc-width of a graph
David Arthur

On a two-sided Turán problem
Dhruv Mubayi ; Yi Zhao

Path counting and random matrix theory
Ioana Dumitriu ; Etienne Rassart

Correspondence between two antimatroid algorithmic characterizations
Yulia Kempner ; Vadim E. Levit

Even circuits of prescribed clockwise parity
Ilse Fischer ; C. H. C. Little

Finding induced acyclic subgraphs in random digraphs
C. R. Subramanian

Global defensive alliances in graphs
Teresa W. Haynes ; Stephen T. Hedetniemi ; Michael A. Henning

A note on graph coloring extensions and list-colorings
Maria Axenovich

A note on the edge-connectivity of cages
Ping Wang ; Baoguang Xu ; Jianfang Wang

Regular character tables of symmetric groups.
Jorn B. Olsson

Dynamic one-pile blocking Nim
Achim Flammenkamp ; Arthur Holshouser ; Harold Reiter

Self-describing sequences and the Catalan family tree
Zoran Šuniƙ

Some remarks on the Plotkin bound
Jörn Quistorff

One pile Nim with arbitrary move function
Arthur Holshouser ; Harold Reiter

On the crossing number of \(K_{m,n}\)
Nagi H. Nahas

Domination, packing and excluded minors
Thomas Böhme ; Bojan Mohar

On hypergraphs with every four points spanning at most two triples
Dhruv Mubayi

The rank of a cograph
Gordon F. Royle

Forestation in hypergraphs: Linear \(k\)-trees
Ojas Parekh

Descents in noncrossing trees
David S. Hough
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité