Spanning trees and orientation of graphs

DOI10.4310/JOC.2010.v1.n2.a1zbMath1219.05044MaRDI QIDQ543985

Carsten Thomassen

Publication date: 14 June 2011

Published in: Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

acyclic orientationsspanning treescyclic orientations of graphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items

FPT algorithms to enumerate and count acyclic and totally cyclic orientations ⋮ The Merino-Welsh conjecture holds for series-parallel graphs ⋮ On the Euler characteristic of Kronecker moduli spaces ⋮ The Merino-Welsh conjecture for split matroids ⋮ Upper bound for the number of spanning forests of regular graphs ⋮ Express the number of spanning trees in term of degrees ⋮ The number of spanning trees of a family of 2-separable weighted graphs ⋮ Bounding the number of bases of a matroid ⋮ On the number of forests and connected spanning subgraphs ⋮ Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs ⋮ Study of exponential growth constants of directed heteropolygonal Archimedean lattices