On acyclic simplicial complexes
From MaRDI portal
Cites work
- Dissimilarity Characteristic Theorems for Graphs
- Enumeration of Triangulations of the Disk
- Historical Note on a Recurrent Combinatorial Problem
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- The number of homeomorphically irreducible trees, and other species
- The Number of Linear, Directed, Rooted, and Connected Graphs
- The number of trees
Cited in
(45)- Bivalent trees and forests or upper bounds for the probability of a union revisited
- Existence of graphs with a given set of r-neighborhoods
- Properties of (0,1)-matrices with no triangles
- n-connectedness in pure 2-complexes
- Degree sets of k-trees: Small k
- A coding algorithm for Rényi trees
- On the cell-growth problem for arbitrary polygons
- Cayley's formula for multidimensional trees
- The square of a chordal graph
- Multidimensional bipartite trees
- On some relations between 2-trees and tree metrics
- Complexity of some graph-based bounds on the probability of a union of events
- On simple characterizations of k-trees
- Bijections on \(r\)-Shi and \(r\)-Catalan arrangements
- \(k\)-Wiener index of a \(k\)-plex
- On maximum signless Laplacian Estrada indices of \(k\)-trees
- Cyclotomic and simplicial matroids
- Counting unlabeled \(k\)-trees
- Enumerating k-trees
- Relating the annihilation number and the total domination number for some graphs
- The triangles method to build X-trees from incomplete distance matrices
- The degree profile and weight in Apollonian networks and k-trees
- An asymptotic analysis of labeled and unlabeled k-trees
- The Reduced Prüfer Code for Rooted Labelled k-Trees
- A Logspace Algorithm for Partial 2-Tree Canonization
- Log-space algorithms for paths and matchings in k-trees
- Colourings of (k-r,k)-trees
- Domination polynomials of \(k\)-tree related graphs
- Multiplicative Zagreb indices of \(k\)-trees
- Graph limits of random unlabelled k-trees
- Domination polynomial of clique cover product of graphs
- Graph limits of random graphs from a subset of connected k-trees
- Ancestors and descendants in evolving k‐tree models
- Rigidity and the lower bound theorem. I
- \((k+1)\)-line graphs of \(k\)-trees
- Interview with Ira Gessel
- The Smith normal form of distance matrices of high dimensional trees
- Plane triangulations without large 2-trees
- The specification of 2-trees
- Cayley trees and increasing 1, 2-trees: let's twist!
- An upper bound on the independent domination number of k-trees
- On maximum Estrada indices of \(k\)-trees
- Isomorphism testing of k-trees is in NC, for fixed k
- Bijective linear time coding and decoding for \(k\)-trees
- Independence polynomials of \(k\)-tree related graphs
This page was built for publication: On acyclic simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540275)
