The following pages link to On acyclic simplicial complexes (Q5540275):
Displaying 40 items.
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- Domination polynomials of \(k\)-tree related graphs (Q471790) (← links)
- Multiplicative Zagreb indices of \(k\)-trees (Q476319) (← links)
- Rigidity and the lower bound theorem. I (Q578590) (← links)
- The specification of 2-trees (Q696853) (← links)
- On maximum Estrada indices of \(k\)-trees (Q890574) (← links)
- Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Independence polynomials of \(k\)-tree related graphs (Q972329) (← links)
- Bivalent trees and forests or upper bounds for the probability of a union revisited (Q1051331) (← links)
- Existence of graphs with a given set of r-neighborhoods (Q1053037) (← links)
- Properties of (0,1)-matrices with no triangles (Q1054733) (← links)
- n-connectedness in pure 2-complexes (Q1076041) (← links)
- Degree sets of k-trees: Small k (Q1164068) (← links)
- A coding algorithm for Rényi trees (Q1207762) (← links)
- On the cell-growth problem for arbitrary polygons (Q1215640) (← links)
- Cayley's formula for multidimensional trees (Q1220079) (← links)
- The square of a chordal graph (Q1322181) (← links)
- Multidimensional bipartite trees (Q1415538) (← links)
- On some relations between 2-trees and tree metrics (Q1584450) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- On simple characterizations of k-trees (Q1844861) (← links)
- Bijections on \(r\)-Shi and \(r\)-Catalan arrangements (Q2040989) (← links)
- \(k\)-Wiener index of a \(k\)-plex (Q2075457) (← links)
- On maximum signless Laplacian Estrada indices of \(k\)-trees (Q2279989) (← links)
- Cyclotomic and simplicial matroids (Q2382259) (← links)
- Counting unlabeled \(k\)-trees (Q2452429) (← links)
- Enumerating k-trees (Q2546877) (← links)
- Relating the annihilation number and the total domination number for some graphs (Q2696610) (← links)
- The triangles method to build<i>X</i>-trees from incomplete distance matrices (Q2773174) (← links)
- The degree profile and weight in Apollonian networks and <i>k</i>-trees (Q2806351) (← links)
- The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323) (← links)
- A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
- Colourings of (k-r,k)-trees (Q4690980) (← links)
- Graph limits of random unlabelled <i>k</i>-trees (Q4987257) (← links)
- Domination polynomial of clique cover product of graphs (Q5130686) (← links)
- Graph limits of random graphs from a subset of connected <i>k</i>‐trees (Q5236927) (← links)
- Ancestors and descendants in evolving <i>k</i>‐tree models (Q5495877) (← links)
- Interview with Ira Gessel (Q6098017) (← links)
