Depth-first search as a combinatorial correspondence

DOI10.1016/0097-3165(79)90108-0zbMATH Open0417.05031OpenAlexW2069422812MaRDI QIDQ754887FDOQ754887

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

graphstreesconnected graphdepth-first searchdirected graphstournamentsTutte polynomialspanning treespanning forestsenumerator

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The inversion enumerator for labeled trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration Of Labelled Graphs
• Title not available (Why is that?)

Cited In (21)

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

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)