Graphs that admit a Hamilton path are cup-stackable (Q7016899)

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 8005124
Language Label Description Also known as
default for all languages
No label defined
    English
    Graphs that admit a Hamilton path are cup-stackable
    scientific article; zbMATH DE number 8005124

      Statements

      Graphs that admit a Hamilton path are cup-stackable (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      6 March 2025
      0 references
      games in graphs
      0 references
      Hamilton path
      0 references
      Cartesian product
      0 references

      Identifiers