PATH-WIDTH OF A GRAPH VS BRIDGE NUMBER OF A KNOT

DOI10.1142/S0218216511009339zbMath1217.05075MaRDI QIDQ3004777

Eunice Mphako-Banda

Publication date: 3 June 2011

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

zbMATH Keywords

knotslinksplanar graphbridge numberpath-width

Mathematics Subject Classification ID

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

Related Items (1)

On virtual pathwidth of virtual graphs of a virtual link

Cites Work

• Unnamed Item
• Unnamed Item
• A Tutte polynomial for signed graphs
• Knot polynomials and generalized mutation
• The vertex separation number of a graph equals its path-width
• The vertex separation and search number of a graph
• Knots and graphs
• Über eine numerische Knoteninvariante
• New Invariants in the Theory of Knots

This page was built for publication: PATH-WIDTH OF A GRAPH VS BRIDGE NUMBER OF A KNOT