Combinatorial aspects of Davenport-Schinzel sequences
From MaRDI portal
Publication:1356764
DOI10.1016/S0012-365X(96)00189-6zbMath0948.05008MaRDI QIDQ1356764
Publication date: 19 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Exact enumeration problems, generating functions (05A15) Graph theory (including graph drawing) in computer science (68R10) Other combinatorial number theory (11B75) Coloring of graphs and hypergraphs (05C15) Special sequences and polynomials (11B83)
Related Items (2)
On trees and noncrossing partitions ⋮ Extremal problems for colored trees and Davenport-Schinzel sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- On the structure of the lattice of noncrossing partitions
- Generalized Davenport-Schinzel sequences with linear upper bound
- Generalized Davenport-Schinzel sequences
- On numbers of Davenport-Schinzel sequences
- On \(abab\)-free and \(abba\)-free set partitions
- Extremal functions for sequences
- A map-theoretic approach to Davenport Schinzel sequences
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
- Enumerating Davenport-Schinzel sequences
- Subgraphs and well‐quasi‐ordering
- On a problem of Davenport and Schinzel
- A Combinatorial Problem Connected with Differential Equations
- A combinatorial problem connected with differential equations II
This page was built for publication: Combinatorial aspects of Davenport-Schinzel sequences
