On acyclic simplicial complexes

DOI10.1112/S002557930000245XzbMath0157.54903OpenAlexW2129565532MaRDI QIDQ5540275

Frank Harary, Edgar M. Palmer

Publication date: 1968

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s002557930000245x

zbMATH Keywords

topology

Related Items

n-connectedness in pure 2-complexes ⋮ An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Cyclotomic and simplicial matroids ⋮ Log-space algorithms for paths and matchings in \(k\)-trees ⋮ On maximum Estrada indices of \(k\)-trees ⋮ A Logspace Algorithm for Partial 2-Tree Canonization ⋮ Interview with Ira Gessel ⋮ Relating the annihilation number and the total domination number for some graphs ⋮ Isomorphism testing of k-trees is in NC, for fixed k ⋮ Multidimensional bipartite trees ⋮ Unnamed Item ⋮ Degree sets of k-trees: Small k ⋮ Domination polynomials of \(k\)-tree related graphs ⋮ Counting unlabeled \(k\)-trees ⋮ Multiplicative Zagreb indices of \(k\)-trees ⋮ Complexity of some graph-based bounds on the probability of a union of events ⋮ A coding algorithm for Rényi trees ⋮ The specification of 2-trees ⋮ Bijective linear time coding and decoding for \(k\)-trees ⋮ Independence polynomials of \(k\)-tree related graphs ⋮ On the cell-growth problem for arbitrary polygons ⋮ The triangles method to buildX-trees from incomplete distance matrices ⋮ Cayley's formula for multidimensional trees ⋮ Rigidity and the lower bound theorem. I ⋮ On maximum signless Laplacian Estrada indices of \(k\)-trees ⋮ Colourings of (k-r,k)-trees ⋮ Domination polynomial of clique cover product of graphs ⋮ Bijections on \(r\)-Shi and \(r\)-Catalan arrangements ⋮ The degree profile and weight in Apollonian networks and k-trees ⋮ Enumerating k-trees ⋮ Graph limits of random unlabelled k-trees ⋮ Graph limits of random graphs from a subset of connected k‐trees ⋮ \(k\)-Wiener index of a \(k\)-plex ⋮ Ancestors and descendants in evolving k‐tree models ⋮ On some relations between 2-trees and tree metrics ⋮ On simple characterizations of k-trees ⋮ 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 ⋮ The Reduced Prüfer Code for Rooted Labelled k-Trees ⋮ The square of a chordal graph

Cites Work

• The number of homeomorphically irreducible trees, and other species
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• The number of trees
• Dissimilarity Characteristic Theorems for Graphs
• Enumeration of Triangulations of the Disk
• Historical Note on a Recurrent Combinatorial Problem
• The Number of Linear, Directed, Rooted, and Connected Graphs