Depth-first search as a combinatorial correspondence

DOI10.1016/0097-3165(79)90108-0MaRDI QIDQ754887zbMATH OpenOpenAlexFDO

Authors Ira M. Gessel, Da-Lun Wang

Publication date 1979

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(79)90108-0

zbMATH Keywords

connected graphdepth-first searchdirected graphsenumeratorgraphsspanning forestsspanning treetournamentstreesTutte polynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Cites work

• Enumeration Of Labelled Graphs
• scientific article; zbMATH DE number 3508512 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3294293 (Why is no real title available?)
• scientific article; zbMATH DE number 3344587 (Why is no real title available?)
• The inversion enumerator for labeled trees

Cited in

(21)

• Une famille de polynômes ayant plusieurs propriétés enumeratives
• Forests and score vectors
• Nombres d'Euler et inversions dans les arbres
• On external activity and inversions in trees
• Mahonian statistics on labeled forests
• Conjectures on the quotient ring by diagonal invariants
• Inverse descents of \(r\)-multipermutations
• A class of labeled posets and the Shi arrangement of hyperplanes
• From G-parking functions to B-parking functions
• Enumerative applications of a decomposition for graphs and digraphs
• An area-depth symmetric \(q, t\)-Catalan polynomial
• Trees, parking functions and factorizations of full cycles
• The continuum limit of critical random graphs
• Triangulations of Cayley and Tutte polytopes
• Parking functions and tree inversions revisited
• On the evaluation of the Tutte polynomial at the points (1, -1) and (2, -1)
• Abelian quiver invariants and marginal wall-crossing.
• On the Tutte and Matching Polynomials for Complete Graphs
• Generalized parking functions, tree inversions, and multicolored graphs
• Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials
• Parking functions: from combinatorics to probability

This page was built for publication: Depth-first search as a combinatorial correspondence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754887)