Enumerative applications of a decomposition for graphs and digraphs
type: Item
instance of: scholarly article
title: Enumerative applications of a decomposition for graphs and digraphs
zbMATH Open document ID: 0827.05045
DOI: 10.1016/0012-365X(94)00135-6
author: Ira M. Gessel
published in: Discrete Mathematics
publication date: 1995-11-27T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 773912
zbMATH Keywords: decomposition
zbMATH Keywords: generating functions
zbMATH Keywords: counting graphs
zbMATH Keywords: complete graph
zbMATH Keywords: trees
zbMATH Keywords: inversion enumeator
zbMATH Keywords: Tutte polynomial
zbMATH Keywords: digraphs
zbMATH Keywords: connected components
MaRDI profile type: Publication
cites work: On external activity and inversions in trees
cites work: Q4770409
cites work: Q4012033
cites work: Q4012032
cites work: Q4088832
cites work: A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
cites work: The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
cites work: Enumeration of trees by inversions
cites work: Depth-first search as a combinatorial correspondence
cites work: Q5682013
cites work: Une famille de polynômes ayant plusieurs propriétés enumeratives
cites work: Q3824338
cites work: The inversion enumerator for labeled trees
cites work: Nombres d'Euler et inversions dans les arbres
cites work: A Contribution to the Theory of Chromatic Polynomials
full work available at URL: 0012-365x(94)00135-6
OpenAlex ID: W2073359459
description: scientific article; zbMATH DE number 773912