Enumerating split-pair arrangements
From MaRDI portal
Publication:2474497
DOI10.1016/J.JCTA.2007.06.003zbMATH Open1144.05006OpenAlexW2154534416MaRDI QIDQ2474497FDOQ2474497
Authors: Ron Graham, Nan Zang
Publication date: 6 March 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.06.003
Recommendations
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Sequencing and scheduling in robotic cells: recent developments
- Increasing trees and alternating permutations
- Title not available (Why is that?)
- Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
- Markov bases of binary graph models
Cited In (13)
- S-arrangements with repetitions
- The doubloon polynomial triangle
- Word-representability of Toeplitz graphs
- On the representation number of a crown graph
- The enumeration of standard puzzles
- Enumeration of self-dual configurations
- Word-Representable Graphs: a Survey
- The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution
- Semi-transitive orientations and word-representable graphs
- Bijections for Entringer families
- Alternation graphs
- Enumerating regular mixed-cell configurations
- Title not available (Why is that?)
Uses Software
This page was built for publication: Enumerating split-pair arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474497)