The link component number of suspended trees

DOI10.1007/s00373-010-0936-7zbMath1221.05080arXiv0905.2478OpenAlexW2024696437MaRDI QIDQ604988

Toshiki Endo

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

knotlinkplanar graphsuspended treelink component number

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

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

• Realizations with a cut-through Eulerian circuit
• LUNE-FREE KNOT GRAPHS
• An index of a graph with applications to knot theory
• Knots, matroids and the Ising model
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The link component number of suspended trees