Type:

Other

Description:

Challenges are presented here relating to graphs (maps of towns and roads). Many editing features are available so you can create and redesign solutions. In the first two challenges, for each graph, you must find a (closed) path that visits every town using no road more than once. In the next two challenges you must connect each pair of towns using as few board positions as possible. Seven more challenges relate to vertex-alternating graphs, in which the degrees of adjacent vertices always differ.

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:262105,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/GraphPuzzles/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467