Acyclic orientations on the Sierpinski gasket
From MaRDI portal
Publication:2861306
Recommendations
Cites work
- scientific article; zbMATH DE number 3794378 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Activity preserving bijections between spanning trees and orientations in graphs
- Acyclic orientations of graphs
- Acyclic orientations of random graphs
- Dimer coverings on the Sierpinski gasket
- EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
- Hamiltonian walks on the Sierpinski gasket
- Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
- Self-avoiding paths on the pre-Sierpinski gasket
- Self-avoiding random walks: Some exactly soluble cases
- Sinks in acyclic orientations of graphs
- Spanning trees on the Sierpinski gasket
- The exponent for the mean square displacement of self-avoiding random walk on the Sierpinski gasket
- The oriented cycle game
Cited in
(7)- Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket
- Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
- Quasirandom-Forcing Orientations of Cycles
- A geometric approach to acyclic orientations
- Tutte polynomial of scale-free networks
- Notes on acyclic orientations and the shelling lemma
- Number of connected spanning subgraphs on the Sierpiński gasket
This page was built for publication: Acyclic orientations on the Sierpinski gasket
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861306)