A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points

Publication date: 1 June 2011

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

Full work available at URL: https://eudml.org/doc/232521

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Recovering the topology of surfaces from cluster algebras ⋮ Rigidity of Quadratic Poisson Tori ⋮ Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan Companion ⋮ On the Approximate Periodicity of Sequences Attached to Non-Crystallographic Root Systems ⋮ Cluster algebras from surfaces and extended affine Weyl groups ⋮ Derived invariants for surface cut algebras of global dimension 2 II: the punctured case

This page was built for publication: A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points