EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K2,n

DOI10.11568/KJM.2012.20.4.403MaRDI QIDQ5887432zbMATH OpenOpenAlexFDO

Authors Dongseok Kim

Publication date 12 April 2023

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

Full work available at URL https://doi.org/10.11568/kjm.2012.20.4.403

zbMATH Keywords

complete bipatite graphlinksSeifert surfaces

Mathematics Subject Classification ID

Topological quantum field theories (aspects of differential topology) (57R56)

Recommendations

• INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS
• The boundaries of dipole graphs and the complete bipartite graphs \(K_{2,n}\)
• Bounds for proper k-connectivity of complete bipartite graphs
• The complete bipartite graphs which have exactly two orientably edge-transitive embeddings
• Bipartite graphs containing every possible pair of cycles
• k-linked graphs with even girth condition
• The complete bipartite graphs with a unique edge-transitive embedding
• Intrinsically n-linked complete graphs
• Bipartite graphs whose edge algebras are complete intersections
• Bipartite graphs with every matching in a cycle

Cites work

• Braided surfaces and Seifert ribbons for closed braids
• Hopf plumbing, arborescent Seifert surfaces, baskets, espaliers, and homogeneous braids
• scientific article; zbMATH DE number 3938045 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3612150 (Why is no real title available?)
• scientific article; zbMATH DE number 791397 (Why is no real title available?)
• Seifert surfaces in open books, and a new coding algorithm for links
• Über das Geschlecht von Knoten

Describes a project that uses

Uses Software

• PSTricks

This page was built for publication: EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K_2,n

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