Intrinsic linking in directed graphs

MaRDI QIDQ888454zbMATH OpenFDO

Authors Joel Foisy, Natalie Rose Rich, Hugh Nelson Howards

Publication date 30 October 2015

Published in Osaka Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.ojm/1437137619

zbMATH Keywords

directed graphsintrinsic linking

Mathematics Subject Classification ID

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

Recommendations

• Intrinsically knotted and 4-linked directed graphs
• Intrinsically triple linked complete graphs
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• Intrinsic linking and knotting in tournaments
• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n

Cites work

• Graph minors. XX: Wagner's conjecture
• Intrinsically triple linked complete graphs
• Knots and links in spatial graphs
• Maximum upward planar subgraphs of embedded planar digraphs
• SOME NEW INTRINSICALLY 3-LINKED GRAPHS
• Sachs' linkless embedding conjecture

Cited in

(4)

• Classifying intrinsically linked tournaments by score sequence
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• Intrinsically knotted and 4-linked directed graphs
• Intrinsic linking and knotting in tournaments

This page was built for publication: Intrinsic linking in directed graphs

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