Operads of finite posets
From MaRDI portal
Publication:1753009
zbMath1391.06003arXiv1604.08149MaRDI QIDQ1753009
Dominique Manchon, Frédéric Fauvet, Loïc Foissy
Publication date: 25 May 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.08149
Symmetric functions and generalizations (05E05) Algebraic aspects of posets (06A11) Connections of Hopf algebras with combinatorics (16T30)
Related Items (2)
Colored operads, series on colored operads, and combinatorial generating systems ⋮ An algebra over the operad of posets and structural binomial identities
Cites Work
- Unnamed Item
- Unnamed Item
- Identifying codes for infinite triangular grids with a finite number of rows
- A simplified NP-complete satisfiability problem
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- Some simplified NP-complete graph problems
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
- Extremal graphs for the identifying code problem
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid
- A linear algorithm for minimum 1-identifying codes in oriented trees
- Minimum-Density Identifying Codes in Square Grids
- On a new class of codes for identifying vertices in graphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Reducibility among Combinatorial Problems
- Identifying Codes in Line Graphs
- Minimum density of identifying codes of king grids
This page was built for publication: Operads of finite posets
