Shuffles and concatenations in the construction of graphs
From MaRDI portal
Publication:4649460
DOI10.1017/S0960129511000648zbMath1266.05103arXiv1002.3577MaRDI QIDQ4649460
Publication date: 22 November 2012
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.3577
Combinatorics of partially ordered sets (06A07) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraph polytopes
- Geometric combinatorial algebras: Cyclohedron and simplex
- A link surgery spectral sequence in monopole Floer homology
- A realization of graph associahedra
- Coxeter complexes and graph-associahedra
- Coalgebras and Bialgebras in Combinatorics
- The Recognition of Series Parallel Digraphs
- Languages under concatenation and shuffling
- The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems
- Associativity as commutativity
- The axiom of choice
This page was built for publication: Shuffles and concatenations in the construction of graphs