Depth-first search as a combinatorial correspondence
From MaRDI portal
Publication:754887
DOI10.1016/0097-3165(79)90108-0zbMath0417.05031OpenAlexW2069422812MaRDI QIDQ754887
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
graphsspanning treetournamentsenumeratortreesdirected graphsTutte polynomialconnected graphdepth-first searchspanning forests
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)
Related Items
On the Tutte and Matching Polynomials for Complete Graphs, Inverse descents of \(r\)-multipermutations, An area-depth symmetric \(q, t\)-Catalan polynomial, Parking functions and tree inversions revisited, Enumerative applications of a decomposition for graphs and digraphs, A class of labeled posets and the Shi arrangement of hyperplanes, On the evaluation of the Tutte polynomial at the points \((1, -1)\) and \((2, -1)\), From G-parking functions to B-parking functions, Une famille de polynômes ayant plusieurs propriétés enumeratives, Abelian quiver invariants and marginal wall-crossing., Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials, Parking functions: from combinatorics to probability, The continuum limit of critical random graphs, Triangulations of Cayley and Tutte polytopes, Forests and score vectors, Nombres d'Euler et inversions dans les arbres, On external activity and inversions in trees, Trees, parking functions and factorizations of full cycles, Mahonian statistics on labeled forests, Generalized parking functions, tree inversions, and multicolored graphs, Conjectures on the quotient ring by diagonal invariants
Cites Work
