On the vertex-face graphs of triangulations
From MaRDI portal
Publication:5124689
Recommendations
Cites work
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 7703288 (Why is no real title available?)
- Algebraic Graph Theory
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- On the entropy of spanning trees on a large triangular lattice
- Resistance distance and the normalized Laplacian spectrum
- Some exact results for spanning trees on lattices
- Spanning trees on graphs and lattices inddimensions
- Spanning trees on hypercubic lattices and nonorientable surfaces
- Spanning trees on lattices and integral identities
- Stability control for a class of complex chaos systems
Cited in
(5)- scientific article; zbMATH DE number 7491438 (Why is no real title available?)
- Combinatorics of trivalent ribbon graphs with two faces
- Generating facets for the cut polytope of a graph by triangular elimination
- Polyhedral graphs with restricted number of faces of the same type
- Vertex labeling of a half-cube to induce face labels in arithmetic progression
This page was built for publication: On the vertex-face graphs of triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124689)