Path-width of a graph vs bridge number of a knot

DOI10.1142/S0218216511009339MaRDI QIDQ3004777zbMATH OpenFDO

Authors Eunice Mphako-Banda

Publication date 3 June 2011

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

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

zbMATH Keywords

bridge numberknotsplanar graphlinkspath-width

Mathematics Subject Classification ID

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

Recommendations

• On virtual pathwidth of virtual graphs of a virtual link
• Knots and graphs
• Knot invariants and the Bollobás-Riordan polynomial of embedded graphs
• scientific article; zbMATH DE number 510380
• Pathwidth of planar and line graphs

Cites work

• scientific article; zbMATH DE number 907055 (Why is no real title available?)
• scientific article; zbMATH DE number 3394154 (Why is no real title available?)
• A Tutte polynomial for signed graphs
• Knot polynomials and generalized mutation
• Knots and graphs
• New Invariants in the Theory of Knots
• The vertex separation and search number of a graph
• The vertex separation number of a graph equals its path-width
• Über eine numerische Knoteninvariante

Cited in

(1)

• On virtual pathwidth of virtual graphs of a virtual link

This page was built for publication: Path-width of a graph vs bridge number of a knot

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004777)