Quantum invariants of links and 3-valent graphs in 3-manifolds
Vladimir Turaev (1993)
Publications Mathématiques de l'IHÉS
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Dotted links, Heegaard diagrams, and colored graphs for PL 4-manifolds.”
Quantum invariants of links and 3-valent graphs in 3-manifolds
Calculating the number of the linear factors in planar graphs.
Saoud, Mahmoud, Al-Khanaifes, Kaled (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Crystallizations and other manifold representations.
Luigi Grasselli (1987)
Disertaciones Matemáticas del Seminario de Matemáticas Fundamentales
Similarity:
Uniqueness of the embedding of a 2-complex into a 3-manifold.
Glock, Janina (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Expected lengths of minimum spanning trees for non-identical edge distributions.
Li, Wenbo V., Zhang, Xinyi (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Folding on the wedge sum of graphs and their fundamental group.
Abu-Saleem, M. (2010)
APPS. Applied Sciences
Similarity:
Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph
Piotr Rudnicki, Lorna Stewart (2012)
Formalized Mathematics
Similarity:
Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of similar material is in [15].
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Anti-Ramsey numbers of spanning double stars.
Montágh, Balázs (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Note on seed graphs with components of given order.
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Derived graphs of some graphs
Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)
Kragujevac Journal of Mathematics
Similarity:
On the -Splitting Graph of a Graph
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
3-manifold spines and bijoins.
Luigi Grasselli (1990)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
We describe a combinatorial algorithm for constructing all orientable 3-manifolds with a given standard bidimensional spine by making use of the idea of bijoin (Bandieri and Gagliardi (1982), Graselli (1985)) over a suitable pseudosimplicial triangulation of the spine.