EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K<sub>2,n</sub> (Q5887432)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7673642
Language Label Description Also known as
default for all languages
No label defined
    English
    EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K<sub>2,n</sub>
    scientific article; zbMATH DE number 7673642

      Statements

      EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K<sub>2,n</sub> (English)
      0 references
      0 references
      0 references
      0 references
      12 April 2023
      0 references
      links
      0 references
      Seifert surfaces
      0 references
      complete bipatite graph
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references