×

Embedded graphs whose links have the largest possible number of components. (English) Zbl 1329.05084

Summary: We derive the basic properties of graphs embedded on surfaces of positive genus whose corresponding link diagrams have the largest possible number of components.

MSC:

05C10 Planar graphs; geometric and topological aspects of graph theory
05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
57M25 Knots and links in the \(3\)-sphere (MSC2010)
PDFBibTeX XMLCite
Full Text: DOI