scientific article; zbMATH DE number 4002122
From MaRDI portal
Publication:3754636
Recommendations
- Network reliability and acyclic orientations
- Generating the Acyclic Orientations of a Graph
- Computing rooted communication reliability in an almost acyclic digraph
- An algorithm for enumerating all spanning trees of a directed graph
- Activity preserving bijections between spanning trees and orientations in graphs
Cited in
(11)- Acyclic orientations and monotonicity in graphs
- Exact periodic wave solutions for the modified Zakharov equations with a quantum correction
- scientific article; zbMATH DE number 3908484 (Why is no real title available?)
- Generating all the acyclic orientations of an undirected graph
- Fixed topology Steiner trees and spanning forests
- Acyclic, connected and tree sets
- Activity preserving bijections between spanning trees and orientations in graphs
- Spanning trees and function classes
- scientific article; zbMATH DE number 3869362 (Why is no real title available?)
- Comparing the number of acyclic and totally cyclic orientations with that of spanning trees of a graph
- Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
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 Q3754636)
