scientific article; zbMATH DE number 861414

MaRDI QIDQ4871148zbMATH OpenFDO

Authors Nathaniel Dean, Keh-Wei Lih, William A. Massey, Peter Winkler, Alexander Kelmans

Publication date 18 August 1996

zbMATH Keywords

digraphenumerationqueuesspanning tree

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Recommendations

• Oriented spanning trees and stationary distribution of digraphs
• A note on the number of spanning trees of line digraphs
• Enumeration of spanning trees of middle digraphs
• On the number of spanning trees and Eulerian tours in iterated line digraphs

Cited in

(10)

• Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
• A note on the number of spanning trees of line digraphs
• Complexity of computation of a spanning tree enumeration algorithm
• scientific article; zbMATH DE number 7378329 (Why is no real title available?)
• Faster enumeration of all spanning trees of a directed graph
• Enumeration of spanning trees in a chain of diphenylene graphs
• Enumeration of spanning trees of middle digraphs
• scientific article; zbMATH DE number 7771742 (Why is no real title available?)
• Oriented spanning trees and stationary distribution of digraphs
• On the SPANNING k-TREE problem

This page was built for publication:

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