DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES

DOI10.1142/S0218216509007671zbMath1181.57007OpenAlexW2075942427MaRDI QIDQ5851750

Xian'an Jin, Fengming Dong, Eng Guan Tay

Publication date: 25 January 2010

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218216509007671

zbMATH Keywords

latticegreatest common divisormedial graphReidemeister movesimple closed curvecomponent number

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items

On plane graphs with link component number equal to the nullity, The number of circles of a maximum state of a plane graph with applications, Extremal embedded graphs, DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Tutte polynomial for signed graphs
• Knots and graphs. I: Arc graphs and colorings
• Spanning trees on hypercubic lattices and nonorientable surfaces
• Straight-ahead walks in Eulerian graphs
• Recursive families of graphs
• LUNE-FREE KNOT GRAPHS
• A polynomial invariant for knots via von Neumann algebras
• New Invariants in the Theory of Knots
• A Contribution to the Theory of Chromatic Polynomials