DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES
From MaRDI portal
Publication:3118665
DOI10.1142/S0218216511009765zbMath1243.57003OpenAlexW2008423637MaRDI QIDQ3118665
Xian'an Jin, Leping Jiang, Kecai Deng
Publication date: 3 March 2012
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218216511009765
greatest common divisortriangular latticemedial graphlink diagramhoneycomb latticecomponent numbergraphical Reidemeister move
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The link component number of suspended trees
- A Tutte polynomial for signed graphs
- On graphs determining links with maximal number of components via medial construction
- Cycle decomposition by disjoint transpositions
- Remarkable valuation of the dichromatic polynomial of planar multigraphs
- Knots and graphs. I: Arc graphs and colorings
- Exact Potts model partition function on strips of the triangular lattice
- Spanning trees on hypercubic lattices and nonorientable surfaces
- Knots and graphs
- Straight-ahead walks in Eulerian graphs
- A polynomial invariant for knots via von Neumann algebras
- New Invariants in the Theory of Knots
- VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS
- A Contribution to the Theory of Chromatic Polynomials
- DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES
- Exact Potts model partition functions on strips of the honeycomb lattice