Spanning trees and orientation of graphs

DOI10.4310/JOC.2010.V1.N2.A1MaRDI QIDQ543985zbMATH OpenFDO

Authors Carsten Thomassen

Publication date 14 June 2011

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

Full work available at URL https://doi.org/10.4310/JOC.2010.V1.N2.A1

zbMATH Keywords

acyclic orientationscyclic orientations of graphsspanning trees

Mathematics Subject Classification ID

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

Recommendations

• A note on spanning trees and totally cyclic orientations of 3-connected graphs
• The Merino-Welsh conjecture holds for series-parallel graphs
• Comparing the number of acyclic and totally cyclic orientations with that of spanning trees of a graph
• On the minimum number of spanning trees in cubic multigraphs
• scientific article; zbMATH DE number 3869362

Cited in

(23)

• The number of spanning trees of a family of 2-separable weighted graphs
• On the number of forests and connected spanning subgraphs
• Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
• FPT algorithms to enumerate and count acyclic and totally cyclic orientations
• Express the number of spanning trees in term of degrees
• Study of exponential growth constants of directed heteropolygonal Archimedean lattices
• A note on spanning trees and totally cyclic orientations of 3-connected graphs
• The Merino-Welsh conjecture holds for series-parallel graphs
• Upper bound for the number of spanning forests of regular graphs
• scientific article; zbMATH DE number 3869362 (Why is no real title available?)
• Oriented Forests in Directed Graphs
• Comparing the number of acyclic and totally cyclic orientations with that of spanning trees of a graph
• Do nearly balanced multigraphs have more spanning trees?
• On the Euler characteristic of Kronecker moduli spaces
• Isometric copies of directed trees in orientations of graphs
• scientific article; zbMATH DE number 2188327 (Why is no real title available?)
• Bounding the number of bases of a matroid
• The Merino-Welsh conjecture for split matroids
• On two conjectures concerning spanning tree edge dependences of graphs
• The Merino-Welsh conjecture is false for matroids
• Types of special graphs and their complexity trees
• Inconsequential results on the Merino-Welsh conjecture for Tutte polynomials
• Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces

This page was built for publication: Spanning trees and orientation of graphs

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