Compact 3-manifolds via 4-colored graphs

DOI10.1007/s13398-015-0240-8zbMath1364.57011arXiv1304.5070OpenAlexW3104595044MaRDI QIDQ326698

Paola Cristofori, Michele Mulazzani

Publication date: 12 October 2016

Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.5070

zbMATH Keywords

complexityHeegaard splitting3-manifoldcolored graph

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15)

Related Items

Crystallizations of compact 4-manifolds minimizing combinatorially defined PL-invariants, G-degree for singular manifolds, Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds, 4-colored graphs and knot/link complements, Unnamed Item, Classifying compact 4-manifolds via generalized regular genus and \(G\)-degree, Combinatorial properties of the G-degree, Topology in colored tensor models via crystallization theory, Regular genus and gem-complexity of some mapping tori

Uses Software

• GAP

Cites Work

• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• Complexity theory of three-dimensional manifolds
• Factorization of 3-manifolds
• Cobordant crystallizations
• Graph-encoded 3-manifolds
• A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
• The combinatorics of colored triangulations of manifolds
• Regular imbeddings of edge-coloured graphs
• Regular genus: the boundary case
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
• 4-colored graphs and knot/link complements
• Computing Matveev's complexity via crystallization theory: the orientable case
• COMPUTING MATVEEV'S COMPLEXITY VIA CRYSTALLIZATION THEORY: THE BOUNDARY CASE
• A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA
• COMPLEXITY, HEEGAARD DIAGRAMS AND GENERALIZED DUNWOODY MANIFOLDS
• NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA
• 3-Manifolds Which Fiber Over a Surface
• Algorithmic topology and classification of 3-manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item